Maximum Likelihood from Incomplete Data Via the EM Algorithm

Volume: 39, Issue: 1, Pages: 1 - 22
Published: Sep 1, 1977
Abstract
S ummary 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,...
Paper Details
Title
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Published Date
Sep 1, 1977
Volume
39
Issue
1
Pages
1 - 22
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.