Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Thomas A. Louis (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: