On constructing an optimal consensus clustering from multiple clusterings

DOI10.1016/j.ipl.2007.06.008zbMath1184.68630MaRDI QIDQ2380012

Ming-Yang Kao, Jie Wang, Piotr Berman, Bhaskar Das Gupta

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

computational complexity; approximation algorithms; consensus clustering

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Related Items

An efficient algorithm for computing the distance between close partitions, HC\_AB: a new heuristic clustering algorithm based on approximate backbone, A commentary on some recent methods in sibling group reconstruction based on set coverings

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