The EM algorithm is a popular method for parameter estimation in a variety of problems involving missing data. However, the EM algorithm often requires significant computational resources and has been dismissed as impractical for large databases. We present two approaches that significantly reduce the computational cost of applying the EM algorithm. Both approaches are based on partial E-steps for which we can use the results of Neal and Hinton (1998) to obtain the standard convergence guarantees of EM. The first approach is a version of the incremental EM, described in Neal and Hinton (1998), which cycles through data cases in blocks. The number of cases in each block dramatically effects the efficiency of the algorithm. We provide a method for selecting a near optimal block size. The second approach, which we call lazy EM, will, at scheduled iterations, evaluate the significance of each case and then proceed for several iterations actively using only the significant cases. We demonstrate that both methods can significantly reduce computational costs through their application to high-dimensional real-world and synthetic mixture modeling problems for large databases.

}, author = {Bo Thiesson and Christopher Meek and David Heckerman}, journal = {Machine Learning}, month = {January}, note = {Also appears as Technical Report MSR-TR-99-31, Microsoft Research, May, 1999 (Revised February, 2001).}, pages = {279-299}, publisher = {Kluwer Academic}, title = {Accelerating EM for large databases}, url = {http://research.microsoft.com/apps/pubs/default.aspx?id=64022}, volume = {45}, year = {2001}, }