DocumentCode
2387109
Title
A Weighted Consensus Function Based on Information-Theoretic Principles to Combine Soft Clusterings
Author
Gao, Yan ; Gu, Shiwen ; Li, Jianhua ; Liao, Zhining
Author_Institution
Central South Univ., Changsha
fYear
2007
fDate
2-4 Nov. 2007
Firstpage
417
Lastpage
417
Abstract
How to combine multiple clusterings into a single clustering solution of better quality is a critical problem in cluster ensemble. In this paper, we extend Strehl\´s consensus function based on information- theoretic principles and propose a novel weighted consensus function to combine multiple "soft" clusterings. In our consensus function, we use mutual information to measure the sharing information between two "soft" clusterings and emphasize the clustering which is much different from the others. We use the algorithm similar to sequential k-means to obtain the solution of this consensus function and conduct experiments on four real-world datasets to compare our algorithm with other four consensus function, including CSPA, HGPA, MCLA, QMI. The results indicate that our consensus function provides solutions of better quality than CSPA, HGPA, MCLA, QMI and when the distribution of diversity in cluster ensembles is uneven, considering the influence of diversity can improve the quality of clustering ensemble.
Keywords
information theory; neural nets; pattern clustering; cluster ensemble; information-theoretic principles; sequential k-means; soft clusterings; weighted consensus function; Bagging; Clustering algorithms; Computer science; Distributed computing; Diversity reception; Gain measurement; Information science; Information theory; Mutual information; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing, 2007. GRC 2007. IEEE International Conference on
Conference_Location
Fremont, CA
Print_ISBN
978-0-7695-3032-1
Type
conf
DOI
10.1109/GrC.2007.156
Filename
4403134
Link To Document