Skip to Main content Skip to Navigation
Journal articles

An efficient algorithm for computing the distance between close partitions

Abstract : A -partition of a set is a splitting of into non-overlapping classes that cover all elements of . Numerous practical applications dealing with data partitioning or clustering require computing the distance between two partitions. Previous articles proved that one can compute it in polynomial time—minimum and maximum —using a reduction to the linear assignment problem. We propose several conditions for which the partition distance can be computed in time. In practical terms, this computation can be done in time for any two relatively resembling partitions (i.e. with distance less than ) except specially constructed cases. Finally, we prove that, even if there is a bounded number of classes for which the proposed conditions are not satisfied, one can still preserve the linear complexity by exploiting decomposition properties of the similarity matrix.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00567981
Contributor : Pascale Kuntz Connect in order to contact the contributor
Submitted on : Tuesday, June 15, 2021 - 4:17:01 PM
Last modification on : Wednesday, April 27, 2022 - 4:17:10 AM
Long-term archiving on: : Thursday, September 16, 2021 - 6:59:33 PM

File

Porumbel2010.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. An efficient algorithm for computing the distance between close partitions. Discrete Applied Mathematics, Elsevier, 2011, 159 (1), pp.53-59. ⟨10.1016/j.dam.2010.09.002⟩. ⟨hal-00567981⟩

Share

Metrics

Record views

101

Files downloads

53