Suppression Distance Computation for Hierarchical Clusterings - Archive ouverte HAL Access content directly
Journal Articles Information Processing Letters Year : 2015

Suppression Distance Computation for Hierarchical Clusterings

François Queyroi
Sergey Kirgizov


We discuss the computation of a distance between two hierarchical clusterings of the same set. It is defined as the minimum number of elements that have to be removed so the remaining clusterings are equal. The problem of distance computing was extensively studied for partitions. We prove it can be solved in polynomial time in the case of hierarchies as it gives birth to a class of perfect graphs. We also propose an algorithm based on recursively computing maximum assignments.
Fichier principal
Vignette du fichier
queyroi2014distance_r3.pdf (283.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00996090 , version 1 (26-05-2014)
hal-00996090 , version 2 (14-10-2014)
hal-00996090 , version 3 (21-04-2015)





François Queyroi, Sergey Kirgizov. Suppression Distance Computation for Hierarchical Clusterings. Information Processing Letters, 2015, 15 (9), pp.689-693. ⟨10.1016/j.ipl.2015.04.007⟩. ⟨hal-00996090v3⟩
175 View
233 Download



Gmail Facebook X LinkedIn More