Maximum Likelihood from Incomplete Data via the EM Algorithm
View/ Open
Rubin_MaxLikelihood.pdf (5.264Mb)
Access Status
Full text of the requested work is not available in DASH at this time ("restricted access"). For more information on restricted deposits, see our FAQ.Metadata
Show full item recordCitation
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.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.Citable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:3426318
Collections
- FAS Scholarly Articles [18256]
Contact administrator regarding this item (to report mistakes or request changes)