Partial Imputation Method in the EM Algorithm
暂无分享,去创建一个
The expectation maximization(EM) algorithm is a general iterative algorithm for the maximum-likelihood estimation(MLE) in incomplete-data problems. Dempster, Laird and Rubin(1977, henceforth DLR) showed that convergence is linear with rate proportional to the ratio of the missing information to the complete information. When a large proportion of data are missing, the speed of convergence can be very slow.
[1] Xiao-Li Meng,et al. On the rate of convergence of the ECM algorithm , 1994 .
[2] Zhi Geng,et al. Decomposability and Collapsibility for Contingency Tables with Missing Data , 1994 .
[3] Zhi Geng. Multidimensional contingency tables with missing data , 1988 .