The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A Fast Improvement to the Em Algorithm on its Own Terms
Abstract
SUMMARY: The EM algorithm is a numerical technique for the evaluation of maximum likelihood estimates for parameters describing incomplete data models. It is easy to apply in many problems and is stable but slow. The algorithm fails to provide a consistent estimator of the standard errors of the maximum likelihood estimates unless the additional analysis required by the Louis method is performed. Newton-type or other gradient methods are faster and provide error estimates but tend to be unstable and require the analytical evaluation of likelihoods to derive expressions for the score function and (at least) approximations to the Fisher information matrix. The purpose of this paper is to expand on a result by Fisher that permits a unification of EM methodology and Newton methods. The evaluation of the individual observation-by-observation score functions of the incomplete data is a by-product of the application of the E step of the EM algorithm. Once these become available, the Fisher information matrix may be consistently estimated, and the M step may be replaced by a fast Newton-type step.
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
Convergence of Probability Measures
Billingsley, P. (1999) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316962 · Cited by 13,910
Convergence of Probability Measures
Kingman, J. F. C., & Billingsley, P. (1969) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402124 · Cited by 6,812
Theory of Statistical Estimation
Fisher, R. A. (1925) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100009580 · Cited by 2,869
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
Computer methods for mathematical computations
Forsythe, G. E., Malcolm, M. A., & Moler, C. (1977) · UCLA Biblioteca de Ingenieria Civil · Cited by 2,683
Finding the Observed Information Matrix When Using the EM Algorithm
Louis, T. A. (1982) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1982.tb01203.x · Cited by 2,229
EFRON, B., & HINKLEY, D. V. (1978) · Biometrika · doi:10.1093/biomet/65.3.457 · Cited by 952
A Statistical Model for Positron Emission Tomography
Vardi, Y., Shepp, L. A., & Kaufman, L. (1985) · Journal of the American Statistical Association · doi:10.1080/01621459.1985.10477119 · Cited by 863
Numerical Methods for Unconstrained Optimization
G., D., & Murray, W. (1975) · Mathematics of Computation · doi:10.2307/2005592 · Cited by 571
Cited by
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
poLCA: An R Package for Polytomous Variable Latent Class Analysis
Linzer, D. A., & Lewis, J. B. (2011) · Journal of Statistical Software · doi:10.18637/jss.v042.i10 · Cited by 1,636
A Monte Carlo Implementation of the EM Algorithm and the Poor Man's Data Augmentation Algorithms
Wei, G. C. G., & Tanner, M. A. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10474930 · Cited by 1,453
Space-alternating generalized expectation-maximization algorithm
Fessler, J. A., & Hero, A. O. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.324732 · Cited by 1,063
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Metadata
- Authors
- Meilijson, I.
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 1989-09-01
- Volume
- 51
- Issue
- 1
- Pages
- 127-138
- ISSN
- 1369-7412 (ISSN-L)
- 1467-9868
- OpenAlex
- W1524403460
- Cited by
- 371
- References
- 13
- FWCI
- 9.34
- 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: A Fast Improvement to the Em Algorithm on its Own Terms. https://app.cochat.ai/papers/10.1111/j.2517-6161.1989.tb01754.x
- The paper
- Meilijson, I. (1989). A Fast Improvement to the Em Algorithm on its Own Terms. Journal of the Royal Statistical Society Series B: Statistical Methodology. https://doi.org/10.1111/j.2517-6161.1989.tb01754.x
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.