Consensus of partitions: a constructive approach

DOI10.1007/s11634-011-0087-6zbMath1253.68258OpenAlexW1969035906MaRDI QIDQ1761306

Alain Guénoche

Publication date: 15 November 2012

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-011-0087-6

zbMATH Keywords

partitionssimulationconsensustransfer distance

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (7)

Bootstrap clustering for graph partitioning ⋮ Lagrangian relaxation and pegging test for the clique partitioning problem ⋮ Distance and consensus for preference relations corresponding to ordered partitions ⋮ Summary and Semi-average Similarity Criteria for Individual Clusters ⋮ Social Network Optimization for Cluster Ensemble Selection ⋮ A Note on the Effectiveness of the Least Squares Consensus Clustering ⋮ Single or Multiple Consensus for Linear Orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum transfer distance between partitions
• Efficient and binary consensus functions on transitively valued relations
• NP-hard problems in hierarchical-tree clustering
• A cutting plane algorithm for a clustering problem
• The median procedure in cluster analysis and social choice theory
• The complexity of computing metric distances between partitions
• Partition-distance: A problem and class of perfect graphs arising in clustering
• Arrowian characterizations of latticial federation consensus functions
• Transfer distance between partitions
• Approximating Symmetric Relations by Equivalence Relations

This page was built for publication: Consensus of partitions: a constructive approach