Clustering by pattern similarity in large data sets
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Discovering local structure in gene expression data: the order-preserving submatrix problem
Proceedings of the sixth annual international conference on Computational biology
Parallel Algorithms for Discovery of Association Rules
Data Mining and Knowledge Discovery
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth
Proceedings of the 17th International Conference on Data Engineering
Biclustering of Expression Data
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Sequential PAttern mining using a bitmap representation
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Enhanced Biclustering on Expression Data
BIBE '03 Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering
OP-Cluster: Clustering by Tendency in High Dimensional Space
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
MaPle: A Fast Algorithm for Maximal Pattern-based Clustering
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
A Fast Algorithm for Subspace Clustering by Pattern Similarity
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Biclustering in Gene Expression Data by Tendency
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Solving the Order-Preserving Submatrix Problem via Integer Programming
INFORMS Journal on Computing
Mining order-preserving submatrices from probabilistic matrices
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We study the problem of pattern-based subspace clustering which is clustering by pattern similarity finds objects that exhibit a coherent pattern of rises and falls in subspaces. Applications of pattern-based subspace clustering include DNA micro-array data analysis. Our goal is to devise pattern-based clustering methods that are capable of: discovering useful patterns of various shapes, and discovering all significant patterns. Our approach is to extend the idea of Order-Preserving Submatrix (OPSM). We devise a novel algorithm for mining OPSM, show that OPSM can be generalised to cover most existing pattern-based clustering models and propose a number of extensions to the original OPSM model.