The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
On Convergence Properties of the EM Algorithm for Gaussian Mixtures
Abstract
We build up the mathematical connection between the “Expectation-Maximization” (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a projection matrix P, and we provide an explicit expression for the matrix. We then analyze the convergence of EM in terms of special properties of P and provide new results analyzing the effect that P has on the likelihood surface. Based on these mathematical results, we present a comparative discussion of the advantages and disadvantages of EM and other algorithms for the learning of 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.
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
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
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
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
Self-citationLevinson, S. E., Rabiner, L. R., & Sondhi, M. M. (1983) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1983.tb03114.x · Cited by 978
Growth transformations for functions on manifolds
Baum, L. E., & Sell, G. (1968) · Pacific Journal of Mathematics · doi:10.2140/pjm.1968.27.211 · Cited by 363
On the Convergence of the EM Algorithm
Boyles, R. A. (1983) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1983.tb01229.x · Cited by 333
An Input Output HMM Architecture
Bengio, Y., & Frasconi, P. (1994) · Florence Research (University of Florence) · Cited by 332
Information geometry of the EM and em algorithms for neural networks
Amari, S.-I. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00003-8 · Cited by 331
Recursive Parameter Estimation Using Incomplete Data
Titterington, D. M. (1984) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1984.tb01296.x · Cited by 324
Convergence results for the EM approach to mixtures of experts architectures
Jordan, M. I., & Xu, L. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00014-3 · Cited by 305
Self-citationA new view of the EM algorithm that justifies incremental and other variants
Neal, R. M. (1993) · Cited by 160
Nowlan, S. J. (1991) · Cited by 124
Statistical Physics, Mixtures of Distributions, and the EM Algorithm
Yuille, A., Stolorz, P., & Utans, J. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.334 · Cited by 97
Training Neural Networks with Deficient Data
Tresp, V., Ahmad, S., & Neuneier, R. (1993) · Cited by 92
Classification using hierarchical mixtures of experts
Waterhouse, S. R., & Robinson, A. J. (2002) · Machine learning for signal processing ... · doi:10.1109/nnsp.1994.366050 · Cited by 84
Mixture of experts regression modeling by deterministic annealing
Rao, A. V., Miller, D. J., Rose, K. H., & Gersho, A. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650107 · Cited by 60
A Constructive, Incremental-Learning Network for Mixture Modeling and Classification
Williamson, J. R. (1997) · Neural Computation · doi:10.1162/neco.1997.9.7.1517 · Cited by 36
Cited by
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
Convex and Semi-Nonnegative Matrix Factorizations
Ding, C. H. Q., Li, T., & Jordan, M. I. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.277 · Cited by 1,317
Self-citationEEG signal classification using wavelet feature extraction and a mixture of expert model.
SUBASI, A. (2007) · Expert Systems with Applications · doi:10.1016/j.eswa.2006.02.005 · Cited by 1,182
New tools for automated cryo-EM single-particle analysis in RELION-4.0
Kimanius, D., Dong, L., Sharov, G., Nakane, T., & Scheres, S. H. W. (2021) · Biochemical Journal · doi:10.1042/bcj20210708 · Cited by 1,086
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901
“In [14], Xu and Jordan discuss convergence properties of the EM algorithm for Gaussian mixture models.”
Background
Metadata
- Authors
- Xu, L., & Jordan, M. I.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1996-01
- Volume
- 8
- Issue
- 1
- Pages
- 129-151
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2134199473
- Cited by
- 756
- References
- 18
- FWCI
- 12.98
- 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.