Multiple Consensuses Clustering by Iterative Merging/Splitting of Clustering Patterns - Archive ouverte HAL Access content directly
Conference Papers Year :

Multiple Consensuses Clustering by Iterative Merging/Splitting of Clustering Patterns

Abstract

The existence of many clustering algorithms with variable performance on each dataset made the clustering task difficult. Consensus clustering tries to solve this problem by combining the partitions generated by different algorithms to build a new solution that is more stable and achieves better results. In this work, we propose a new consensus method that, unlike others, give more insight on the relations between the different partitions in the clusterings ensemble, by using the frequent closed itemsets technique, usually used for association rules discovery. Instead of generating one consensus, our method generates multiple consensuses based on varying the number of base clusterings, and links these solutions in a hierarchical representation that eases the selection of the best clustering. This hierarchical view also provides an analysis tool, for example to discover strong clusters or outlier instances.

Dates and versions

hal-01330216 , version 1 (10-06-2016)

Identifiers

Cite

Atheer Al-Najdi, Nicolas Pasquier, Frédéric Precioso. Multiple Consensuses Clustering by Iterative Merging/Splitting of Clustering Patterns. Machine Learning and Data Mining in Pattern Recognition, Jul 2016, New York, United States. pp.790-804, ⟨10.1007/978-3-319-41920-6⟩. ⟨hal-01330216⟩
101 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More