Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Entropy-based subspace clustering for mining numerical data
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Co-clustering documents and words using bipartite spectral graph partitioning
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Clustering based on conditional distributions in an auxiliary space
Neural Computation
Discriminative Clustering: Optimal Contingency Tables by Learning Metrics
ECML '02 Proceedings of the 13th European Conference on Machine Learning
An Adaptive Meta-Clustering Approach: Combining the Information from Different Clustering Results
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
The Journal of Machine Learning Research
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fully automatic cross-associations
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Non-redundant clustering with conditional ensembles
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Associative Clustering for Exploring Dependencies between Functional Genomics Data Sets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Clustering with Bregman Divergences
The Journal of Machine Learning Research
Learning Parts-Based Representations of Data
The Journal of Machine Learning Research
Knowledge and Information Systems
Non-redundant Multi-view Clustering via Orthogonalization
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Finding Alternative Clusterings Using Constraints
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Learning non-redundant codebooks for classifying complex objects
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
A principled and flexible framework for finding alternative clusterings
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Flexible constrained spectral clustering
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Unifying dependent clustering and disparate clustering for non-homogeneous data
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
minCEntropy: A Novel Information Theoretic Approach for the Generation of Alternative Clusterings
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Multivariate information bottleneck
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Block clustering of contingency table and mixture model
IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Given a clustering algorithm, how can we adapt it to find multiple, nonredundant, high-quality clusterings? We focus on algorithms based on vector quantization and describe a framework for automatic `alternatization' of such algorithms. Our framework works in both simultaneous and sequential learning formulations and can mine an arbitrary number of alternative clusterings. We demonstrate its applicability to various clustering algorithms--k-means, spectral clustering, constrained clustering, and co-clustering--and effectiveness in mining a variety of datasets.