Journal article

Maximum Likelihood from Incomplete Data via the EM Algorithm

Dempster A, Laird N, Rubin D ...see all

Journal of the Royal Statistical Society, vol. B, issue 39 (1976) pp. 1-38

  • 3

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.
Sign in to save reference

Abstract

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.

Author-supplied keywords

  • em algorithm
  • incomplete data
  • maximum likelihood
  • posterior mode

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links

Authors

  • A. P. Dempster

  • N. M. Laird

  • D. B. Rubin

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free