Cluster ensembles: a knowledge reuse framework for combining partitionings
Eighteenth national conference on Artificial intelligence
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
BordaConsensus: a new consensus function for soft cluster ensembles
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
An Efficient Spectral Method for Document Cluster Ensemble
ICYCS '08 Proceedings of the 2008 The 9th International Conference for Young Computer Scientists
Hi-index | 0.00 |
Ensemble techniques have been successfully applied in the supervised machine learning area to increase the accuracy and stability of base learner. Recently, analogous techniques have been investigated in unsupervised machine learning area. Research has showed that, by combining an ensemble of multiple clusterings, a superior solution can be attained. In this paper, we solve the cluster combination problem in term of finding a "best" subspace and formulate it as an optimization problem. Then, we get the solution according to basic concept and theorem in linear algebra whereupon a novel cluster combination algorithm is proposed. We compare our algorithm with other common cluster ensemble algorithms on real-world datasets. Experimental results demonstrate the effectiveness of our algorithm.