The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Clustering ensembles: models of consensus and weak partitions
Abstract
Clustering ensembles have emerged as a powerful method for improving both the robustness as well as the stability of unsupervised classification solutions. However, finding a consensus clustering from multiple partitions is a difficult problem that can be approached from graph-based, combinatorial, or statistical perspectives. This study extends previous research on clustering ensembles in several respects. First, we introduce a unified representation for multiple clusterings and formulate the corresponding categorical clustering problem. Second, we propose a probabilistic model of consensus using a finite mixture of multinomial distributions in a space of clusterings. A combined partition is found as a solution to the corresponding maximum-likelihood problem using the EM algorithm. Third, we define a new consensus function that is related to the classical intraclass variance criterion using the generalized mutual information definition. Finally, we demonstrate the efficacy of combining partitions generated by weak clustering algorithms that use data projections and random data splits. A simple explanatory model is offered for the behavior of combinations of such weak clustering components. Combination accuracy is analyzed as a function of several parameters that control the power and resolution of component partitions as well as the number of partitions. We also analyze clustering ensembles with incomplete information and the effect of missing cluster labels on the quality of overall consensus. Experimental results demonstrate the effectiveness of the proposed methods on several real-world data sets.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Self-citationRUBIN, D. B. (1976) · Biometrika · doi:10.1093/biomet/63.3.581 · Cited by 9,925
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
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
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Measures of Association for Cross Classifications
Goodman, L. A., & Kruskal, W. H. (1979) · Springer Series in Statistics · doi:10.1007/978-1-4612-9995-0 · Cited by 2,244
Unsupervised 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-citationMonti, S., Tamayo, P., Mesirov, J., & Golub, T. (2003) · Machine Learning · doi:10.1023/a:1023949509487 · Cited by 2,116
Knowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
Ben‐Hur, A., Horn, D., Siegelmann, H. T., & Vapnik, V. N. (2002) · doi:10.5555/944790.944807 · Cited by 1,330
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,262
An analysis of Bayesian classifiers
Langley, P., Iba, W., & Thompson, K. (1992) · Cited by 1,214
Arcing classifier (with discussion and a rejoinder by the author)
Breiman, L. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691079 · Cited by 1,105
Latent Variable Models and Factor Analysis
Tatsuoka, K., & Bartholomew, D. J. (1989) · Journal of Educational Statistics · doi:10.2307/1164730 · Cited by 1,008
(1967) · Cited by 853
Dimensionality reduction using genetic algorithms
Raymer, M. L., Punch, W. F., Goodman, E. D., Kuhn, L. A., & Jain, A. K. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.850656 · Cited by 840
Self-citationAbola, E. E., Bernstein, F. C., & Koetzle, T. F. (1984) · Neutrons in Biology · doi:10.1007/978-1-4899-0375-4_26 · Cited by 735
Measures of Association for Cross Classifications*
Goodman, L. A., & Kruskal, W. H. (1954) · Journal of the American Statistical Association · doi:10.1080/01621459.1954.10501231 · Cited by 678
Random projection for high dimensional data clustering: a cluster ensemble approach
Fern, X. Z., & Brodley, C. E. (2003) · Cited by 595
Supervised learning from incomplete data via an EM approach
Zoubin Ghahramani, A., & Jordan, M. I. (1993) · Cited by 552
(2002) · Cited by 542
Bagging to improve the accuracy of a clustering procedure
Dudoit, S., & Fridlyand, J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg038 · Cited by 530
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-citationFred, A. L. N., & Jain, A. K. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2003.1211462 · Cited by 362
Self-citationA Monte Carlo algorithm for fast projective clustering
Procopiuc, C. M., Jones, M., Agarwal, P. K., & Murali, T. M. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564739 · Cited by 340
Cluster ensembles: a knowledge reuse framework for combining partitionings
Strehl, A. L., & Ghosh, J. (2002) · doi:10.5555/777092.777110 · Cited by 320
Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy
Michalski, R. S., & Stepp, R. E. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767409 · Cited by 320
Information, Uncertainty and the Utility of Categories
Gluck, M. (1985) · eScholarship (California Digital Library) · Cited by 311
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
Path-based clustering for grouping of smooth curves and texture segmentation
Fischer, B., & Buhmann, J. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1190577 · Cited by 216
Bagging for path-based clustering
Fischer, B., & Buhmann, J. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1240115 · Cited by 211
Automated star/galaxy discrimination with neural networks
Odewahn, S. C., Stockwell, E. B., Pennington, R. L., Humphreys, R. M., & Zumach, W. A. (1992) · The Astronomical Journal · doi:10.1086/116063 · Cited by 196
Kleinberg, E. M. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531079 · Cited by 143
Ensembles of partitions via data resampling
Bidgoli, B. M., Topchy, A. P., & Punch, W. F. (2004) · International Conference on Information Technology: Coding and Computing (ITCC) · doi:10.1109/itcc.2004.1286629 · Cited by 132
Self-citationAutomated Star/Galaxy Discrimination with Neural Networks
Odewahn, S. C., Stockwell, E. B., Pennington, R. L., Humphreys, R. M., & Zumach, W. (1992) · Astrophysics and space science library · doi:10.1007/978-94-011-2472-0_28 · Cited by 127
Voting-Merging: An Ensemble Method for Clustering
Dimitriadou, E., Weingessel, A., & Hornik, K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44668-0_31 · Cited by 97
A Monte Carlo algorithm for fast projective clustering
Procopiuc, C. M., Jones, M., Agarwal, P., & Murali, T. M. (2002) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/564736.564739 · Cited by 94
Tsoumakas, G. (2009) · IGI Global eBooks · doi:10.4018/978-1-60566-010-3.ch110 · Cited by 60
Using projections to visually cluster high-dimensional data
Hinneburg, A., Keim, D. A., & Wawryniuk, M. (2003) · Computing in Science & Engineering · doi:10.1109/mcise.2003.1182958 · Cited by 14
(1996)
Cited by
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
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
An Evolutionary Approach to Multiobjective Clustering
Handl, J., & Knowles, J. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.877146 · Cited by 717
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
Multiobjective Optimization in Bioinformatics and Computational Biology
Handl, J., Kell, D. B., & Knowles, J. (2007) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.070203 · Cited by 308
Metadata
- Authors
- Topchy, A., Jain, A. K., & Punch, W.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2005-12
- Volume
- 27
- Issue
- 12
- Pages
- 1866-1881
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2115346774
- Cited by
- 675
- References
- 45
- FWCI
- 23.36
- 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.