An efficient algorithm for computing the distance between close partitions

DOI10.1016/J.DAM.2010.09.002MaRDI QIDQ617900zbMATH OpenOpenAlexFDO

Authors Jin-Kao Hao, Pascale Kuntz, Daniel Cosmin Porumbel

Publication date 14 January 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.09.002

zbMATH Keywords

clustering comparisonpartition distancepartition metricsimilarity between partitionssimilarity measure

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05)

Recommendations

• Partition-distance: A problem and class of perfect graphs arising in clustering
• Extremes in the Complexity of Computing Metric Distances Between Partitions
• Counting and computing the Rand and block distances of pairs of set partitions
• A structure of the nearest neighbors collective in a family of partitions of a finite set
• Transfer distance between partitions

Cites work

• A constant-time dynamic storage allocator for real-time systems
• A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
• scientific article; zbMATH DE number 3874429 (Why is no real title available?)
• scientific article; zbMATH DE number 2208163 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Hybrid evolutionary algorithms for graph coloring
• Maximum transfer distance between partitions
• On constructing an optimal consensus clustering from multiple clusterings
• Partition-distance: A problem and class of perfect graphs arising in clustering
• The complexity of computing metric distances between partitions
• Transfer distance between partitions

Cited in

(17)

• Partition-distance: A problem and class of perfect graphs arising in clustering
• Counting and computing the Rand and block distances of pairs of set partitions
• Suppression distance computation for hierarchical clusterings
• Transfer distance between partitions
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
• Extremes in the Complexity of Computing Metric Distances Between Partitions
• On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
• Memetic search for the max-bisection problem
• Maximum of the transfer distance to a given partition
• scientific article; zbMATH DE number 3903779 (Why is no real title available?)
• Data structures for maintaining set partitions
• A structure of the nearest neighbors collective in a family of partitions of a finite set
• An efficient algorithm for computing free distance (Corresp.)
• A massively parallel evolutionary algorithm for the partial Latin square extension problem
• A memetic algorithm with adaptive operator selection for graph coloring
• Improving the extraction and expansion method for large graph coloring
• Chain development

This page was built for publication: An efficient algorithm for computing the distance between close partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617900)