The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A classification EM algorithm for clustering and two stochastic versions
Overview
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
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
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Statistical Analysis of Finite Mixture Distributions.
Lindsay, B. G., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1987) · Journal of the American Statistical Association · doi:10.2307/2289504 · Cited by 2,905
Mixture Densities, Maximum Likelihood and the EM Algorithm
Redner, R. A., & Walker, H. F. (1984) · SIAM Review · doi:10.1137/1026034 · Cited by 2,693
Simulated annealing: Theory and applications
Rota, G. (1988) · Advances in Mathematics · doi:10.1016/0001-8708(88)90072-2 · Cited by 607
Clustering Methods Based on Likelihood Ratio Criteria
Scott, A. J., & Symons, M. J. (1971) · Biometrics · doi:10.2307/2529003 · Cited by 464
Another interpretation of the EM algorithm for mixture distributions
Hathaway, R. J. (1986) · Statistics & Probability Letters · doi:10.1016/0167-7152(86)90016-7 · Cited by 246
Mathematical Programming in Statistics.
Brown, R. A., Arthanari, T. S., & Dodge, Y. (1982) · Biometrics · doi:10.2307/2529904 · Cited by 187
Experiments in projection and clustering by simulated annealing
Klein, R. W., & Dubes, R. C. (1989) · Pattern Recognition · doi:10.1016/0031-3203(89)90067-8 · Cited by 176
Classification as a tool of research
(1985) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(85)90008-8 · Cited by 155
Clustering criteria for discrete data and latent class models
Celeux, G., & Govaert, G. (1991) · Journal of Classification · doi:10.1007/bf02616237 · Cited by 115
Self-citationAsymptotic behaviour of classification maximum likelihood estimates
BRYANT, P., & WILLIAMSON, J. A. (1978) · Biometrika · doi:10.1093/biomet/65.2.273 · Cited by 114
389: Separating Mixtures of Normal Distributions
Marriott, F. H. C. (1975) · Biometrics · doi:10.2307/2529563 · Cited by 80
Large-sample results for optimization-based clustering methods
Bryant, P. G. (1991) · Journal of Classification · doi:10.1007/bf02616246 · Cited by 47
Classification and Mixture Approaches to Clustering via Maximum Likelihood
Ganesalingam, S. (1989) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2347733 · Cited by 39
Cited by
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Model-Based Clustering, Discriminant Analysis, and Density Estimation
Fraley, C., & Raftery, A. E. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502760047131 · Cited by 4,257
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
Centroidal Voronoi Tessellations: Applications and Algorithms
Du, Q., Faber, V., & Gunzburger, M. (1999) · SIAM Review · doi:10.1137/s0036144599352836 · Cited by 2,244
Metadata
- Authors
- Celeux, G., & Govaert, G.
- Venue
- Computational Statistics & Data Analysis
- Publisher
- Elsevier BV
- Published
- 1992-10
- Volume
- 14
- Issue
- 3
- Pages
- 315-332
- ISSN
- 0167-9473 (ISSN-L)
- OpenAlex
- W2059279601
- Cited by
- 772
- References
- 17
- FWCI
- 1.79
- 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.