Maximum Likelihood from Incomplete Data Via the EM Algorithm

A. P. Dempster, N. M. Laird, D. B. Rubin

1977Published
34.3KCitations
0References
journal articleType

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.

Journal: Journal of the Royal Statistical Society Series B: Statistical Methodology

Publisher: Oxford University Press (OUP)

Citations are the number of DOI-registered works in Crossref that cite this paper; references are how many works it cites. Full text is on the publisher site via the DOI link.