Maximum Likelihood from Incomplete Data Via the EM Algorithm
A. P. Dempster, Nan M. Laird, Donald B. Rubin · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1977
Summary A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situations, applications to grouped, censored or truncated data, finite mixture models, variance component estimation, hyperparameter estimation, iteratively reweighted least squares and factor analysis.
Cited by 49,340 works. doi:10.1111/j.2517-6161.1977.tb01600.x
Authors
References
- Linear Statistical Inference and its Applications
- Discrete Multivariate Analysis: Theory and Practice.
- An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process
- Inference and missing data
- Theory of Statistical Estimation
- Applied Statistical Decision Theory
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- Robust Estimation of a Location Parameter
- The two sample problem with censored data
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology