Skip to Main content Skip to Navigation
Journal articles

Suppression Distance Computation for Hierarchical Clusterings

François Queyroi 1 Sergey Kirgizov 1
1 ComplexNetworks
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : François Queyroi Connect in order to contact the contributor
Submitted on : Tuesday, April 21, 2015 - 9:44:51 AM
Last modification on : Friday, January 8, 2021 - 5:32:05 PM
Long-term archiving on: : Tuesday, April 18, 2017 - 7:39:24 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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



Record views


Files downloads