Name
Abstract | ||
|---|---|---|
Clustering ensemble, also referred to as consensus clustering, has emerged as a method of combining an ensemble of different clusterings to derive a final clustering that is of better quality and robust than any single clustering in the ensemble. Normally clustering ensemble algorithms in the literature combine all the clusterings without learning the ensemble. But by learning the ensemble, one can define the merit of a clustering or even a cluster in it, in forming a quality consensus. In this work, we propose a cluster-level surprisal measure to define the merit of a clustering that reflects both levels of agreement as well as disagreement among clusters. Using the proposed measure of merit, we devise a polynomial heuristics that judiciously selects a subset of clusterings from the ensemble that contribute positively in forming the consensus. We also empirically show that consensus achieved by our proposed method performs better in terms of quality compared to well-known clustering ensemble algorithms on different benchmark datasets. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1080/09540091.2020.1866496 | CONNECTION SCIENCE |
Keywords | DocType | Volume |
Clustering ensemble, consensus clustering, weighted clustering, clustering, entropy | Journal | 33 |
Issue | ISSN | Citations |
3 | 0954-0091 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arko Banerjee | 1 | 0 | 0.68 |
| Arun K. Pujari | 2 | 420 | 48.20 |
| Chhabi Rani Panigrahi | 3 | 31 | 10.03 |
| Bibudhendu Pati | 4 | 18 | 10.24 |
| Suvendu Chandan Nayak | 5 | 0 | 0.34 |
| Tien-Hsiung Weng | 6 | 0 | 0.34 |