The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
An Experimental Comparison of Model-Based Clustering Methods
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
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
Pattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
Optimal Statistical Decisions.
Siegmund, D., & DeGroot, M. H. (1972) · Journal of the American Statistical Association · doi:10.2307/2284675 · Cited by 3,386
An Introduction to Generalized Linear Models.
Chang, P. C., & Dobson, A. J. (1991) · Journal of the American Statistical Association · doi:10.2307/2290548 · Cited by 2,509
Model-Based Gaussian and Non-Gaussian Clustering
Banfield, J. D., & Raftery, A. E. (1993) · Biometrics · doi:10.2307/2532201 · Cited by 2,395
Optimal Statistical Decisions.
Lindley, D. V., & de Groot, M. (1971) · Applied Statistics · doi:10.2307/2346640 · Cited by 1,802
Bayesian classification (AutoClass): theory and results
Cheeseman, P. C., & Stutz, J. (1996) · Cited by 975
Cited by
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/jmlr.2003.3.4-5.993 · Cited by 3,024
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
Comparing clusterings—an information based distance
Meilă, M. (2007) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2006.11.013 · Cited by 1,546
Self-citationAn empirical comparison of four initialization methods for the K-Means algorithm
Peña, J. M., Lozano, J. A., & Larrañaga, P. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00069-0 · Cited by 866
Biernacki, C., Celeux, G., & Govaert, G. (2003) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(02)00163-9 · Cited by 658
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Comparing Clusterings by the Variation of Information
Meilă, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_14 · Cited by 604
Self-citationAlternatives to the k-means algorithm that find better clusterings
Hamerly, G., & Elkan, C. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584890 · Cited by 426
An Approach for Determining the Number of Clusters in a Model-Based Cluster Analysis
Akogul, S., & Erisoglu, M. (2017) · Entropy · doi:10.3390/e19090452 · Cited by 269
Self-organizing Maps as Substitutes for K-Means Clustering
Bação, F., Lobo, V., & Painho, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11428862_65 · Cited by 266
A Guide to Conquer the Biological Network Era Using Graph Theory
Koutrouli, M., Karatzas, E., Paez-Espino, D., & Pavlopoulos, G. A. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.00034 · Cited by 264
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
Ostrovsky, R., Rabani, Y., Schulman, L., & Swamy, C. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.75 · Cited by 261
(2009) · Cited by 107
SWISH: semantic analysis of window titles and switching history
Oliver, N., Smith, G., Thakkar, C., & Surendran, A. C. (2006) · Proceedings of the 11th international conference on Intelligent user interfaces · doi:10.1145/1111449.1111492 · Cited by 89
Metadata
- Authors
- Meilă, M., & Heckerman, D.
- Venue
- Machine Learning
- Published
- 2001-01
- Volume
- 42
- Issue
- 1-2
- Pages
- 9-29
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2127042504
- Cited by
- 280
- References
- 21
- FWCI
- 10.14
- Type
- journal article
- Language
- en
- Open access
- bronze
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.