On constructing an optimal consensus clustering from multiple clusterings

DOI10.1016/J.IPL.2007.06.008MaRDI QIDQ2380012zbMATH OpenOpenAlexFDO

Authors Piotr Berman, Ming-Yang Kao, Jie Wang, Bhaskar Dasgupta

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.06.008

zbMATH Keywords

approximation algorithmscomputational complexityconsensus clustering

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Algorithms and Computation
• On the approximation of correlation clustering and consensus clustering
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
• SIMILARITY-BASED COMBINATION OF MULTIPLE CLUSTERINGS
• On the parameterized complexity of consensus clustering

Cites work

• On the complexity of approximating the independent set problem
• Optimization, approximation, and complexity classes
• Partition-distance: A problem and class of perfect graphs arising in clustering
• Proof verification and the hardness of approximation problems

Cited in

(14)

• Consensus of partitions: a constructive approach
• HC\_AB: a new heuristic clustering algorithm based on approximate backbone
• On the parameterized complexity of consensus clustering
• \textit{MultiClust} special issue on discovering, summarizing and using multiple clusterings
• A review on consensus clustering methods
• A commentary on some recent methods in sibling group reconstruction based on set coverings
• On the parameterized complexity of consensus clustering
• SIMILARITY-BASED COMBINATION OF MULTIPLE CLUSTERINGS
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
• On seeking consensus between document similarity measures
• A Biclustering Framework for Consensus Problems
• Determinantal consensus clustering
• An efficient algorithm for computing the distance between close partitions
• Condorcet’s Jury Theorem for Consensus Clustering

This page was built for publication: On constructing an optimal consensus clustering from multiple clusterings

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