Skip to content

Maximum Likelihood from Incomplete Data Via the EM Algorithm

A. P. Dempster, Nan M. Laird, Donald B. Rubin

Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1977 · 51,256 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B (Statistical Methodology), 39(1), 1–22. https://doi.org/10.1111/j.2517-6161.1977.tb01600.x

In text: (Dempster et al., 1977)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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.

  1. Bias in meta-analysis detected by a simple, graphical test1997
  2. Some Tests of Specification for Panel Data: Monte Carlo Evidence and an Application to Employment Equations1991
  3. A Heteroskedasticity-Consistent Covariance Matrix Estimator and a Direct Test for Heteroskedasticity1980
  4. Alternative Ways of Assessing Model Fit1992
  5. lmerTest Package: Tests in Linear Mixed Effects Models2017

Metadata from OpenAlex (CC0). Citations are generated from the published record.