Name
Abstract | ||
|---|---|---|
Cluster ensembles combine multiple clusterings of a set of objects into a single consolidated clustering, often referred to as the consensus solution. Consensus clustering can be used to generate more robust and stable clustering results compared to a single clustering approach, perform distributed computing under privacy or sharing constraints, or reuse existing knowledge. This paper describes a variety of algorithms that have been proposed to address the cluster ensemble problem, organizing them in conceptual categories that bring out the common threads and lessons learnt while simultaneously highlighting unique features of individual approaches. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 305–315 DOI: 10.1002/widm.32 |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1002/widm.32 | Encyclopedia of Machine Learning |
Keywords | DocType | Volume |
Knowl Discov,cluster ensemble problem,consensus solution,cluster ensemble,single clustering approach,single consolidated clustering,consensus clustering,John Wiley,Inc. WIREs Data Mining,stable clustering result | Journal | 1 |
Issue | Citations | PageRank |
4 | 24 | 0.78 |
References | Authors | |
30 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joydeep Ghosh | 1 | 7041 | 462.41 |
| Ayan Acharya | 2 | 109 | 12.35 |