News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Artículo

Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm

A. P. Dempster; N. M. Laird; Donald B. Rubin · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1977

Resource page
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
A. P. Dempster; N. M. Laird; Donald B. Rubin
Publisher
Journal of the Royal Statistical Society Series B (Statistical Methodology)
Year
1977
Language
English

Resource access

Open the content from the main option or choose another available source.

OpenAlex OpenAlex Works
Entrar por OpenAlex
Main access

Resource page

Resource reference page. Full text availability has not been automatically confirmed.
Open resource

Summary

Descripción general del contenido del recurso.

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.

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Dempster, A. P, Laird, N. M, & Rubin, D. B. (1977). Maximum Likelihood from Incomplete Data Via the EM Algorithm. https://doi.org/10.1111/j.2517-6161.1977.tb01600.x

MLA

Dempster, A. P, et al. "Maximum Likelihood from Incomplete Data Via the EM Algorithm." 1977. https://doi.org/10.1111/j.2517-6161.1977.tb01600.x.

Chicago

Dempster, A. P, N. M. Laird, and Donald B. Rubin. 1977. "Maximum Likelihood from Incomplete Data Via the EM Algorithm.". https://doi.org/10.1111/j.2517-6161.1977.tb01600.x.

Harvard

Dempster, A. P, Laird, N. M. and Rubin, D. B. 1977, Maximum Likelihood from Incomplete Data Via the EM Algorithm, Journal of the Royal Statistical Society Series B (Statistical Methodology), available at: https://doi.org/10.1111/j.2517-6161.1977.tb01600.x [Accessed 6 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
Author / contributors
A. P. Dempster; N. M. Laird; Donald B. Rubin
Publisher
Journal of the Royal Statistical Society Series B (Statistical Methodology)
Publication year
1977
Language
English

Subjects

Explore related resources through these subjects.

Maximum likelihood; Expectation–maximization algorithm; Computer science; Algorithm; Mathematics; Statistics
Copied