Maximum Likelihood from Incomplete Data Via the EM Algorithm
A. P. Dempster, N. M. Laird, and D. B. Rubin published "Maximum Likelihood from Incomplete Data Via the EM Algorithm" in the Journal of the Royal Statistical Society: Series B in 1977. The paper presents a broadly applicable algorithm for computing maximum-likelihood estimates from incomplete data and derives monotonic-likelihood and convergence results.
Historical classification
This verified record belongs to LINEAiGE's artificial-intelligence history layer beginning in 1956.
Why it matters
A documented statistical-computation and machine-learning milestone for the expectation-maximization algorithm, preserved at publication-year precision while keeping the earlier 1976 Royal Statistical Society presentation distinct from the 1977 journal publication.
People, organizations & technologies
PEOPLE
A. P. Dempster, N. M. Laird, D. B. Rubin
TECHNOLOGIES
Expectation-maximization algorithm, Maximum likelihood, Incomplete-data estimation
Evidence & verification
STATE
verified
CONFIDENCE
high
LAST VERIFIED
2026-09-15T07:07:46+08:00
Wiley's journal record identifies the 1977 publication, authors, journal placement, volume 39 issue 1, pages 1-22, DOI 10.1111/j.2517-6161.1977.tb01600.x, and the paper's broadly applicable maximum-likelihood algorithm for incomplete data. Harvard DASH separately records that the work was presented to the Royal Statistical Society on 8 December 1976. LINEAiGE therefore records the 1977 journal-publication milestone at year precision and does not convert the 1976 presentation into the publication date or infer a universal invention date, geography, ancestry, influence, causality, or relationship edge.
Sources
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Wiley / Royal Statistical Society
Maximum Likelihood from Incomplete Data via the EM Algorithm
Harvard University DASH
Trace the chronology
Record identity
LINEAiGE IDdempster-laird-rubin-em-algorithm-1977