论文信息 - Finding the Observed Information Matrix When Using the EM Algorithm

Finding the Observed Information Matrix When Using the EM Algorithm

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.

T. Louis

[1] H. Hartley. Maximum Likelihood Estimation from Incomplete Data , 1958 .

[2] Roger Fletcher,et al. A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[3] S. Zacks. The theory of statistical inference , 1972 .

[4] B. Turnbull. Nonparametric Estimation of a Survivorship Function with Doubly Censored Data , 1974 .

[5] R. Sundberg. An iterative method for solution of the likelihood equations for incomplete data from exponential families , 1976 .

[6] Thomas A. Louis,et al. Screening for the early detection of cancer— III. Estimation of disease natural history☆ , 1978 .

[7] B. Efron,et al. Assessing the accuracy of the maximum likelihood estimator: Observed versus expected Fisher information , 1978 .

[8] N. Laird. Nonparametric Maximum Likelihood Estimation of a Mixing Distribution , 1978 .

[9] G. Dinse,et al. Nonparametric estimation for partially-complete time and type of failure data. , 1982, Biometrics.

[10] T. Louis,et al. Approximate Posterior Distributions for Incomplete Data Problems , 1982 .