Journal article · 1977 · Open access
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Journal of the Royal Statistical Society Series B (Statistical Methodology), 39(1), 1–22 · Published 1 September 1977 · DOI 10.1111/j.2517-6161.1977.tb01600.x
In brief
“Maximum Likelihood from Incomplete Data Via the EM Algorithm” is a 1977 journal article by A. P. Dempster and 2 co-authors, published in Journal of the Royal Statistical Society Series B (Statistical Methodology). OpenAlex counts 51,151 citations as of 16 November 2026, which puts it in the top 1% of works published in 1977 by citations. It is open access under a CC BY licence: the full text is free to read at Digital Access to Scholarship at Harvard (DASH) (Harvard University).
- Citations
- 51,151
- Most cited in
- 2019 (2,150)
- Field-weighted impact
- 26.06
- References
- 81
- Authors
- 3
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.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
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
MLA 9
Dempster, A. P., et al. “Maximum Likelihood from Incomplete Data Via the EM Algorithm.” Journal of the Royal Statistical Society Series B (Statistical Methodology), vol. 39, no. 1, 1977, pp. 1–22. https://doi.org/10.1111/j.2517-6161.1977.tb01600.x.
Chicago
Dempster, A. P., Nan M. Laird, and Donald B. Rubin. 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.
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), 39(1), pp. 1–22. doi:10.1111/j.2517-6161.1977.tb01600.x.
IEEE
A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum Likelihood from Incomplete Data Via the EM Algorithm,” Journal of the Royal Statistical Society Series B (Statistical Methodology), vol. 39, no. 1, pp. 1–22, 1977, doi: 10.1111/j.2517-6161.1977.tb01600.x.
BibTeX
@article{dempster1977maximum,
title = {{Maximum Likelihood from Incomplete Data Via the EM Algorithm}},
author = {Dempster, A. P. and Laird, Nan M. and Rubin, Donald B.},
journal = {Journal of the Royal Statistical Society Series B (Statistical Methodology)},
year = {1977},
volume = {39},
number = {1},
pages = {1--22},
doi = {10.1111/j.2517-6161.1977.tb01600.x},
url = {https://doi.org/10.1111/j.2517-6161.1977.tb01600.x}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 1,987 | |
| 2018 | 2,089 | |
| 2019 | 2,150 | |
| 2020 | 2,028 | |
| 2021 | 2,037 | |
| 2022 | 1,636 | |
| 2023 | 1,503 | |
| 2024 | 1,352 | |
| 2025 | 1,335 | |
| 2026 | 1,253 |
Its field-weighted citation impact is 26.06: it has been cited 26.06 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
- expectation-maximization algorithm
- maximum likelihood estimation
- missing data
- algorithm convergence
- censored data
- truncated data
- grouped data
- mixture models
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
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
How many times has this paper been cited?
51,151 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at Digital Access to Scholarship at Harvard (DASH) (Harvard University).
Who wrote this paper?
A. P. Dempster, Nan M. Laird, Donald B. Rubin.
What is the DOI of this paper?
10.1111/j.2517-6161.1977.tb01600.x. The permanent link is https://doi.org/10.1111/j.2517-6161.1977.tb01600.x.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.