A Polynomial Time Approximation Scheme for k-Consensus Clustering.
Tom ColemanAnthony WirthPublished in: SODA (2010)
Keyphrases
- polynomial time approximation
- consensus clustering
- approximation algorithms
- np hard
- error bounds
- clustering ensemble
- decision trees
- approximation guarantees
- bin packing
- greedy algorithm
- combining multiple clusterings
- unsupervised classification
- information retrieval
- microarray
- worst case
- evolutionary algorithm
- lower bound
- genetic algorithm