The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A robust EM clustering algorithm for Gaussian mixture models
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“GMMs model cluster structure in terms of both means and full covariance matrices, enabling elliptical clusters that better reflect behavioural dependencies in discourse data (Yang et al. 2012).”
From Emergent Learner Agency in Implicit Human– AI Collaboration: How Supportive and Contrarian AI Personas Reshape Interaction (2026) · cites this paper as Yang et al. 2012
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
(1967) · Cited by 23,719
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
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
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
Pattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Cited by
Unsupervised K-Means Clustering Algorithm
Sinaga, K. P., & Yang, M.-S. (2020) · IEEE Access · doi:10.1109/access.2020.2988796 · Cited by 2,244
Self-citationStreamflow forecasting using extreme gradient boosting model coupled with Gaussian mixture model
Ni, L., Wang, D., Wu, J., Wang, Y., Tao, Y., Zhang, J., & Liu, J. (2020) · Journal of Hydrology · doi:10.1016/j.jhydrol.2020.124901 · Cited by 272
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
Zheng, Y., Schupp, J., Adams, T., Clair, G., Justet, A., Ahangari, F., Yan, X., Hansen, P., Carlon, M., Cortesi, E., et al. (2023) · doi:10.21203/rs.3.rs-3676579/v1 · Cited by 34
Jin, Y., Martinez‐Maldonado, R., Gašević, D., Han, X., & Yan, L. (2026) · Journal of Computer Assisted Learning · doi:10.1002/jcal.70310 · Cited by 1
Metadata
- Authors
- Yang, M.-S., Lai, C.-Y., & Lin, C.-Y.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2012-11
- Volume
- 45
- Issue
- 11
- Pages
- 3950-3961
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2152842394
- Cited by
- 366
- References
- 33
- FWCI
- 8.23
- 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.