Maximum Likelihood Estimation via the ECM Algorithm: A General Framework
Xiao‐Li Meng, Donald B. Rubin · Biometrika · 1993
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.
Cited by 1,861 works. doi:10.1093/biomet/80.2.267
Authors
References
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Statistical Analysis With Missing Data
- Monte Carlo sampling methods using Markov chains and their applications
- An Efficient Method of Estimating Seemingly Unrelated Regressions and Tests for Aggregation Bias
- Inference and missing data
- Practical Methods of Optimization
- Principles of mathematical analysis
- On the Statistical Analysis of Dirty Pictures
- Inference from Iterative Simulation Using Multiple Sequences
- Analysis of frequency data