The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Combining multiple clusterings using evidence accumulation
Abstract
We explore the idea of evidence accumulation (EAC) for combining the results of multiple clusterings. First, a clustering ensemble--a set of object partitions, is produced. Given a data set (n objects or patterns in d dimensions), different ways of producing data partitions are: 1) applying different clustering algorithms and 2) applying the same clustering algorithm with different values of parameters or initializations. Further, combinations of different data representations (feature spaces) and clustering algorithms can also provide a multitude of significantly different data partitionings. We propose a simple framework for extracting a consistent clustering, given the various partitions in a clustering ensemble. According to the EAC concept, each partition is viewed as an independent evidence of data organization, individual data partitions being combined, based on a voting mechanism, to generate a new n x n, similarity matrix between the n patterns. The final data partition of the n patterns is obtained by applying a hierarchical agglomerative clustering algorithm on this matrix. We have developed a theoretical framework for the analysis of the proposed clustering combination strategy and its evaluation, based on the concept of mutual information between data partitions. Stability of the results is evaluated using bootstrapping techniques. A detailed discussion of an evidence accumulation-based clustering algorithm, using a split and merge strategy based on the K-means clustering algorithm, is presented. Experimental results of the proposed method on several synthetic and real data sets are compared with other combination strategies, and with individual clustering results produced by well-known clustering algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Self-citationIntroduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,355
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Cited by
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Dong, X., Yu, Z., Cao, W., Shi, Y., & Ma, Q. (2020) · Frontiers of Computer Science · doi:10.1007/s11704-019-8208-z · Cited by 1,928
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection
Campello, R. J. G. B., Moulavi, D., Zimek, A., & Sander, J. (2015) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2733381 · Cited by 915
A Survey of Evolutionary Algorithms for Clustering
Hruschka, E. R., Campello, R. J. G. B., Freitas, A. A., & de Carvalho, A. C. P. L. F. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2008.2007252 · Cited by 759
A SURVEY OF CLUSTERING ENSEMBLE ALGORITHMS
VEGA-PONS, S., & RUIZ-SHULCLOPER, J. (2011) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001411008683 · Cited by 609
A survey of Web clustering engines
Carpineto, C., Osiński, S., Romano, G., & Weiss, D. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541884 · Cited by 399
Critical limitations of consensus clustering in class discovery
Șenbabaoğlu, Y., Michailidis, G., & Li, J. Z. (2014) · Scientific Reports · doi:10.1038/srep06207 · Cited by 379
Cai, W., Ryali, S., Chen, T., Li, C.-S. R., & Menon, V. (2014) · The Journal of Neuroscience · doi:10.1523/jneurosci.3048-14.2014 · Cited by 362
Locally Weighted Ensemble Clustering
Huang, D., Wang, C.-D., & Lai, J.-H. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2702343 · Cited by 371
Acoustic sequences in non‐human animals: a tutorial review and prospectus
Kershenbaum, A., Blumstein, D. T., Roch, M. A., Akçay, Ç., Backus, G., Bee, M. A., Bohn, K., Cao, Y., Carter, G., Cäsar, C., et al. (2016) · Biological Reviews · doi:10.1111/brv.12160 · Cited by 337
Lemaître, G., Martí, R., Freixenet, J., Vilanova, J. C., Walker, P. M., & Meriaudeau, F. (2015) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2015.02.009 · Cited by 348
Multi-level bootstrap analysis of stable clusters in resting-state fMRI
Bellec, P., Rosa-Neto, P., Lyttelton, O. C., Benali, H., & Evans, A. C. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2010.02.082 · Cited by 333
Evaluation of Stability of k-Means Cluster Ensembles with Respect to Random Initialization
Kuncheva, L. I., & Vetrov, D. P. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.226 · Cited by 325
Onan, A., Korukoğlu, S., & Bulut, H. (2017) · Information Processing & Management · doi:10.1016/j.ipm.2017.02.008 · Cited by 305
Ensembles for unsupervised outlier detection: challenges and research questions a position paper
Zimek, A., Campello, R. J. G. B., & Sander, J. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2594473.2594476 · Cited by 278
Deep Clustering: A Comprehensive Survey
Ren, Y., Pu, J., Yang, Z., Xu, J., Li, G., Pu, X., Yu, P. S., & He, L. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3403155 · Cited by 276
Blind PRNU-Based Image Clustering for Source Identification
Marra, F., Poggi, G., Sansone, C., & Verdoliva, L. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2701335 · Cited by 84
Wong, W., Noreika, V., Móró, L., Revonsuo, A., Windt, J., Valli, K., & Tsuchiya, N. (2020) · Neuroscience of Consciousness · doi:10.1093/nc/niaa006 · Cited by 40
Teghipco, A., Newman-Norlund, R., Fridriksson, J., Rorden, C., & Bonilha, L. (2024) · Communications Medicine · doi:10.1038/s43856-024-00541-8 · Cited by 11
Metadata
- Authors
- Fred, A. L. N., & Jain, A. K.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2005-06
- Volume
- 27
- Issue
- 6
- Pages
- 835-850
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2139280638
- Cited by
- 1,195
- References
- 47
- FWCI
- 31.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.