login

Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm

Journal of the Royal Statistical Society Series B (Statistical Methodology)Published 1 September 1977
A. P. Dempster, N. M. Laird, Donald B. Rubin
Citations49,657
SJR quartileQ1
SJR score3.31
SNIP2.48

Abstract

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.

Keywords

Computer ScienceMathematicsEngineering