The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
SMEM Algorithm for Mixture Models
Abstract
We present a split-and-merge expectation-maximization (SMEM) algorithm to overcome the local maxima problem in parameter estimation of finite mixture models. In the case of mixture models, local maxima often involve having too many components of a mixture model in one part of the space and too few in another, widely separated part of the space. To escape from such configurations, we repeatedly perform simultaneous split-and-merge operations using a new criterion for efficiently selecting the split-and-merge candidates. We apply the proposed algorithm to the training of gaussian mixtures and mixtures of factor analyzers using synthetic and real data and show the effectiveness of using the split- and-merge operations to improve the likelihood of both the training data and of held-out test data. We also show the practical usefulness of the proposed algorithm by applying it to image compression and pattern recognition problems.
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
Cited by
(2003) · Cited by 1,680
Feature Selection for Unsupervised Learning
Dy, J., & Brodley, C. E. (2004) · doi:10.5555/1005332.1016787 · Cited by 885
Incremental Online Learning in High Dimensions
Vijayakumar, S., D'Souza, A., & Schaal, S. (2005) · Neural Computation · doi:10.1162/089976605774320557 · Cited by 527
Unsupervised segmentation of natural images via lossy data compression
Yang, A. Y., Wright, J., Ma, Y., & Sastry, S. S. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.07.005 · Cited by 509
Expectation-Maximization Gaussian-Mixture Approximate Message Passing
Vila, J. P., & Schniter, P. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2272287 · Cited by 501
Metadata
- Authors
- Ueda, N., Nakano, R., Ghahramani, Z., & Hinton, G. E.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 2000-09-01
- Volume
- 12
- Issue
- 9
- Pages
- 2109-2128
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2114759290
- Cited by
- 409
- References
- 1
- FWCI
- 19.99
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SMEM Algorithm for Mixture Models. https://app.cochat.ai/papers/10.1162/089976600300015088
- The paper
- Ueda, N., Nakano, R., Ghahramani, Z., & Hinton, G. E. (2000). SMEM Algorithm for Mixture Models. Neural Computation. https://doi.org/10.1162/089976600300015088
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.