Elements of information theory
Elements of information theory
Machine Learning
The Random Subspace Method for Constructing Decision Forests
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Brief Introduction to Boosting
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Cluster ensembles: a knowledge reuse framework for combining partitionings
Eighteenth national conference on Artificial intelligence
Data Clustering Using Evidence Accumulation
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
Combining Multiple Weak Clusterings
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
A clustering method based on boosting
Pattern Recognition Letters
Ensemble Clustering in Medical Diagnostics
CBMS '04 Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems
Soft spectral clustering ensemble applied to image segmentation
Frontiers of Computer Science in China
Hi-index | 0.00 |
Clustering ensemble is a new topic in machine learning. It can find a combined clustering with better quality from multiple partitions. But how to find the combined clustering is a difficult problem. In this paper, we extend the object function proposed by Strehl & Ghosh which is based on mutual information and we present a new algorithm similar to information bottleneck to solve the object function. This algorithm can combine "soft" partitions and need not establish label correspondence between different partitions. We conducted experiments on four real-world data sets to compare our algorithm with other five ensemble algorithms, including CSPA, HGPA, MCLA, QMI. The results indicate that our algorithm provides solutions of improved quality.