Scinovex
articleTop 10% cited

Finding the Observed Information Matrix When Using the <i>EM</i> Algorithm

Thomas A. Louis

Abstract

Summary A procedure is derived for extracting the observed information matrix when the EM algorithm is used to find maximum likelihood estimates in incomplete data problems. The technique requires computation of a complete-data gradient vector or second derivative matrix, but not those associated with the incomplete data likelihood. In addition, a method useful in speeding up the convergence of the EM algorithm is developed. Two examples are presented.

Citations
2,218
FWCI
12.79
field-weighted impact
References
15
Percentile
98%
vs. same field & year
Citations per year
Cited by
Hierarchical Generalized Linear Models
Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1996 · 967 citations
Space-alternating generalized expectation-maximization algorithm
IEEE Transactions on Signal Processing · 1994 · 1,049 citations
Convergence of a stochastic approximation version of the EM algorithm
The Annals of Statistics · 1999 · 759 citations
The Calculation of Posterior Distributions by Data Augmentation
Journal of the American Statistical Association · 1987 · 3,753 citations
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
IEEE Transactions on Signal Processing · 2016 · 1,714 citations
Genotype imputation for genome-wide association studies
Nature Reviews Genetics · 2010 · 1,718 citations
Score Tests for Association between Traits and Haplotypes when Linkage Phase Is Ambiguous
The American Journal of Human Genetics · 2002 · 1,793 citations
References
Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1977 · 49,286 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.