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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
