Publication: Maximum Likelihood from Incomplete Data via the EM Algorithm
Date
1976
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Dempster, Arthur P, Nan M. Laird, and Donald B. Rubin. 1976. Maximum Likelihood from Incomplete Data via the EM Algorithm. Paper presented at the Royal Statistical Society at a meeting organized by the Research Section, December 8, 1976.
Research Data
Abstract
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behavior 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.
Description
Other Available Sources
Keywords
maximum likelihood, incomplete data, EM algorithm, posterior mode
Terms of Use
Metadata Only