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,168
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
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Kittler, J., Hatef, M., Duin, R. P. W., & Matas, J. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.667881 · Cited by 5,290
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
Mean shift, mode seeking, and clustering
Cheng, Y. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400568 · Cited by 3,856
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
Finding Groups in Data: An Introduction to Cluster Analysis.
Sarle, W. S., Kaufman, L., & Rousseeuw, P. J. (1991) · Journal of the American Statistical Association · doi:10.2307/2290430 · Cited by 3,539
How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
Fraley, C. (1998) · The Computer Journal · doi:10.1093/comjnl/41.8.578 · Cited by 2,549
Model-Based Gaussian and Non-Gaussian Clustering
Banfield, J. D., & Raftery, A. E. (1993) · Biometrics · doi:10.2307/2532201 · Cited by 2,395
Feature selection: evaluation, application, and small sample performance
Jain, A., & Zongker, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.574797 · Cited by 2,171
Self-citationUnsupervised learning of finite mixture models
Figueiredo, M. A. T., & Jain, A. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990138 · Cited by 2,125
Self-citationChameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
On cluster validity for the fuzzy c-means model
Pal, N. R., & Bezdek, J. C. (1995) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.413225 · Cited by 1,850
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Clustering Using a Similarity Measure Based on Shared Near Neighbors
Jarvis, R. A., & Patrick, E. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223640 · Cited by 955
Pattern Recognition, Third Edition
Theodoridis, S., & Koutroumbas, K. (2006) · Academic Press, Inc. eBooks · Cited by 582
Data clustering using evidence accumulation
Fred, A. L. N., & Jain, A. K. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1047450 · Cited by 515
Self-citationA robust competitive clustering algorithm with applications in computer vision
Frigui, H., & Krishnapuram, R. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765656 · Cited by 487
Bayesian approaches to Gaussian mixture modeling
Roberts, S. J., Husmeier, D., Rezek, I., & Penny, W. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.730550 · Cited by 317
Finding Consistent Clusters in Data Partitions
Fred, A. L. N. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48219-9_31 · Cited by 303
Self-citationValidity studies in clustering methodologies
Dubes, R., & Jain, A. K. (1979) · Pattern Recognition · doi:10.1016/0031-3203(79)90034-7 · Cited by 296
Self-citationInformation theoretic clustering
Gokcay, E., & Principe, J. C. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.982897 · Cited by 293
Distribution Free Decomposition of Multivariate Data
Comaniciu, D., & Meer, P. (1999) · Pattern Analysis & Applications · doi:10.1007/s100440050011 · Cited by 166
Classifier Combinations: Implementations and Theoretical Issues
Lam, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45014-9_7 · Cited by 157
Bootstrap technique in cluster analysis
Jain, A. K., & Moreau, J. V. (1987) · Pattern Recognition · doi:10.1016/0031-3203(87)90081-1 · Cited by 143
Self-citationFinding curvilinear features in spatial point patterns: principal curve clustering with noise
Stanford, D. C., & Raftery, A. E. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.862198 · Cited by 132
Detection and separation of ring-shaped clusters using fuzzy clustering
Man, Y. H., & Gath, I. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.308484 · Cited by 111
A monothetic clustering method
Marie Chavent, A. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(98)00087-7 · Cited by 104
Conceptual clustering in information retrieval
(1998) · doi:10.1109/3477.678640 · Cited by 84
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Fischer, B. M., Zöller, T., & Buhmann, J. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44745-8_16 · Cited by 68
Bailey, T. A., & Dubes, R. C. (1982) · Pattern Recognition · doi:10.1016/0031-3203(82)90002-4 · Cited by 59
Large-scale parallel data clustering
Judd, D., McKinley, P. K., & Jain, A. K. (1996) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1996.547613 · Cited by 47
Self-citationMDL-based selection of the number of components in mixture models for pattern classification
Tenmoto, H., Kudo, M., & Shimbo, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0033308 · Cited by 29
A Comparative Study of String Dissimilarity Measures in Structural Clustering
Fred, A. L. N., & Leitão, J. M. N. (1999) · International Conference on Advances in Pattern Recognition · doi:10.1007/978-1-4471-0833-7_39 · Cited by 12
Self-citation
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
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.