On the choice of the number of blocks with the incremental EM algorithm for the fitting of normal mixtures

Statistics and Computing

Volumn 13, Issue 1, 2003, Pages 45-55

  Ng, S K ^a   McLachlan, G J ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Efficient updating formulas; Incremental EM algorithm; Partial E step; Sparse IEM algorithm

Indexed keywords

EID: 0345832327     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021987710829     Document Type: Article

References (20)

1. Bradley P.S., Fayyad U.M., and Reina C.A. 1998. Scaling EM (expectation-maximization) clustering to large databases. Technical Report No. MSR-TR-98-35 (revised February, 1999), Microsoft Research, Seattle.
2. Dempster A.P., Laird N.M., and Rubin D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society Series B 39: 1-38.
3. Friedman J.H. 1989. Regularized discriminant analysis. Journal of the American Statistical Association 84: 165-175.
4. Fukunaga K. 1990. Statistical Pattern Recognition, 2nd edn. Academic Press, New York.
5. Jamshidian M. and Jennrich R.I. 1993. Conjugate gradient acceleration of the EM algorithm. Journal of the American Statistical Association 88: 221-228.
6. Jamshidian M. and Jennrich R.I. 1997. Acceleration of the EM algorithm by using quasi-Newton methods. Journal of the Royal Statistical Society Series B 59: 569-587.
7. Liang Z., MacFall J.R., and Harrington O.P. 1994. Parameter estimation and tissue segmentation from multispectral MR images. IEEE Transactions on Medical Imaging 13: 441-449.
8. McCallum A., Nigam K., and Ungar L.H. 2000. Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, pp. 169-178.
9. McLachlan G.J. and Krishnan T. 1997. The EM Algorithm and Extensions. Wiley, New York.
10. McLachlan G.J. and Ng S.K. 2000. A sparse version of the incremental EM algorithm for large databases. Technical Report, Centre of Statistics, University of Queensland.
11. McLachlan G.J. and Peel D. 2000. Finite Mixture Models. Wiley, New York.
12. McLachlan G.J., Peel D., Basford K.E., and Adams P. 1999. The EMMIX software for the fitting of mixtures of normal and tcomponents. Journal of Statistical Software 4(2).
13. Meilijson I. 1989. A fast improvement to the ECM algorithm on its own terms. Journal of the Royal Statistical Society Series B 51: 127-138.
14. Meng X.L. 1994. On the rate of convergence of the ECM algorithm. Annals of Statistics 22: 326-339.
15. Meng X.L. and Rubin D.B. 1993. Maximum likelihood estimation via the ECM algorithm: A general framework. Biometrika 80: 267-278.
16. Meng X.L. and van Dyk D. (1997). The EM algorithm - An old folk-song sung to a fast new tune (with discussion). Journal of the Royal Statistical Society Series B 59: 511-567.
17. Moore A.W. 1999. Very fast EM-based mixture model clustering using multiresolution kd-trees. In: Kearns M.S., Solla S.A., and Cohn D.A. (Eds.), Advances in Neural Information Processing Systems 11. MIT Press, Cambridge, MA, pp. 543-549.
18. Neal R.M. and Hinton G.E. 1998. A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan M.I. (Ed.), Learning in Graphical Models. Kluwer, Dordrecht, pp. 355-368.
19. Thiesson B. 1995. Accelerated quantification of Bayesian networks with incomplete data. In: Fayyad U.M. and Uthurusamy R. (Eds.), Proceedings of First International Conference on Knowledge Discovery and Data Mining. AAAI Press, pp. 306-311.
20. Thiesson B., Meek C., and Heckerman D. 2001. Accelerating EM for large databases. Machine Learning 45: 279-299.