The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Maximum likelihood estimation via the ECM algorithm: A general framework
Abstract
Two major reasons for the popularity of the EM algorithm are that its maximum step involves only complete-data maximum likelihood estimation, which is often computationally simple, and that its convergence is stable, with each iteration increasing the likelihood. When the associated complete-data maximum likelihood estimation itself is complicated, EM is less attractive because the M-step is computationally unattractive. In many cases, however, complete-data maximum likelihood estimation is relatively simple when conditional on some function of the parameters being estimated. We introduce a class of generalized EM algorithms, which we call the ECM algorithm, for Expectation/Conditional Maximization (CM), that takes advantage of the simplicity of complete-data conditional maximum likelihood estimation by replacing a complicated M-step of EM with several computationally simpler CM-steps. We show that the ECM algorithm shares all the appealing convergence properties of EM, such as always increasing the likelihood, and present several illustrative examples.
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Statistical Analysis With Missing Data
Lahiff, M., Little, R. J. A., & Rubin, D. B. (1989) · Journal of the American Statistical Association · doi:10.2307/2289883 · Cited by 17,265
Self-citationInference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
Self-citationMonte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
RUBIN, D. B. (1976) · Biometrika · doi:10.1093/biomet/63.3.581 · Cited by 9,925
Self-citationAn Efficient Method of Estimating Seemingly Unrelated Regressions and Tests for Aggregation Bias
Zellner, A. (1962) · Journal of the American Statistical Association · doi:10.1080/01621459.1962.10480664 · Cited by 8,401
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Principles of mathematical analysis
Rudin, W. (1964) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 5,300
On the Statistical Analysis of Dirty Pictures
Besag, J. (1986) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1986.tb01412.x · Cited by 4,191
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
Unbalanced Repeated-Measures Models with Structured Covariance Matrices
Jennrich, R. I., & Schluchter, M. D. (1986) · Biometrics · doi:10.2307/2530695 · Cited by 1,325
(2022) · United Nations Scientific Committee on the Effects of Atomic Radiation (UNSCEAR) Reports · doi:10.18356/9789210010030c014 · Cited by 560
Using EM to Obtain Asymptotic Variance-Covariance Matrices: The SEM Algorithm
Meng, X.-L., & Rubin, D. B. (1991) · Journal of the American Statistical Association · doi:10.1080/01621459.1991.10475130 · Cited by 559
Self-citationElements of Statistical Computing: Numerical Computation
Thisted, R. A. (2017) · Routledge eBooks · doi:10.1201/9780203758212 · Cited by 334
On the Rate of Convergence of the ECM Algorithm
Meng, X. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325371 · Cited by 117
Self-citation
Cited by
Inference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
Self-citationMcLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Precision mapping of quantitative trait loci.
Zeng, Z. B. (1994) · Genetics · doi:10.1093/genetics/136.4.1457 · Cited by 3,182
Hunter, D. R., & Lange, K. (2004) · The American Statistician · doi:10.1198/0003130042836 · Cited by 1,783
Modeling the Drop-Out Mechanism in Repeated-Measures Studies
Little, R. J. A. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476615 · Cited by 1,522
Metadata
- Authors
- MENG, X.-L., & RUBIN, D. B.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 1993
- Volume
- 80
- Issue
- 2
- Pages
- 267-278
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W1967639437
- Cited by
- 1,861
- References
- 15
- FWCI
- 21.72
- 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.