= Maximum Likelihood from Incomplete Data via the EM Algorithm by Arthur Pentland Dempster and others
{c}
{tag=Work by Arthur Pentland Dempster}
{tag=Work by Nan M. Laird}
{tag=Work by Donald B. Rubin}
{title2=1977}
{title2=10.1111/j.2517-6161.1977.tb01600.x}
By <Arthur Pentland Dempster>, <Nan M. Laird>, <Donald B. Rubin>.
Published in Journal of the Royal Statistical Society. Series B (Methodological), volume 39, number 1.
Online text: https://web.mit.edu/6.435/www/Dempster77.pdf
Joint article by <Arthur Pentland Dempster>, <Nan M. Laird> and <Donald B. Rubin>, printed with the byline A. P. Dempster, N. M. Laird and D. B. Rubin. Published in 1977 in Journal of the Royal Statistical Society, Series B, volume 39, number 1. The December 1976 presentation and later scan date are distinct from publication.
Cited passages: Section 1, printed pp. 1 and 3: naming of the two steps and earlier special cases; Section 2, printed p. 6, equation (2.17) and the general E-step/M-step definition; Section 2, printed p. 6: general maximization step; Section 3, printed pp. 6-7, Lemma 1 and Theorem 1, especially equation (3.10); Section 4.3, printed pp. 15-16, especially the paragraph following equation (4.3.3): conditional indicator probabilities and weighted counts.
Back to article page
