Maximum likelihood from incomplete data via the EM algorithm.

Author(s)
Dempster, A.P. Laird, N.M. & Rubin, D.B.
Year
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.

Request publication

11 + 0 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
941560 ST [electronic version only]
Source

Journal of the Royal Statistical Society, Series B; Methodological, Vol. 39 (1977), No. 1, p. 1-22, 50 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.