Combining hierarchical clusterings using min-transitive closure

9 years 1 months ago
Combining hierarchical clusterings using min-transitive closure
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approaches, once applied to a hierarchical clusterings combination problem, are not capable of taking advantage of the information inherent in the input clusterings hierarchy, and may thus be suboptimal. In this paper, a new hierarchical clusterings combination framework is proposed for combining multiple dendrograms directly. In this framework, the description matrices of the primary hierarchical clusterings are aggregated into a transitive consensus matrix with which the final clustering is formed. Experiments on real-world datasets indicate that this framework provides solutions of improved quality.
Abdolreza Mirzaei, Mohammad Rahmati
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICPR
Authors Abdolreza Mirzaei, Mohammad Rahmati
Comments (0)