Estimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm

Pattern Recognition Letters

Volumn 25, Issue 16, 2004, Pages 1799-1809

  Wang, Hai Xian ^a   Luo, Bin ^a   Zhang, Quan Bing ^a   Wei, Sui ^a  

^a ANHUI UNIVERSITY   (China)

Author keywords

EM algorithm; Finite mixture model; Model selection; Number of components; SSMEM algorithm

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ITERATIVE METHODS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; STATISTICAL METHODS;

EM ALGORITHM; FINITE MIXTURE MODEL; MODEL SELECTION; NUMBER OF COMPONENTS; STEPWISE SPLIT-AND-MERGE EM (SSMEM) ALGORITHM;

PATTERN RECOGNITION;

EID: 8344256555     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2004.07.007     Document Type: Article

References (30)

1. Akaike, H., 1974. A new look at statistical model identification. IEEE Trans. Automat. Control 19, 716-723.
2. Ball, G.H., Hall, D.J., 1967. A clustering technique for summarizing multivariate data. Behav. Sci. 12, 153-155.
3. Barron, A., Rissanen, J., Yu, B., 1998. The minimum description length principle in coding and modeling. IEEE Trans. Inform. Theory 44 (6), 2743-2760.
4. Biernjacki, C., Celeux, G., Govaert, G., 2000. Assessing a mixture model for clustering with the integrated classification likelihood. IEEE Trans. Pattern Anal. Machine Intell. 24 (3), 381-396, 22(7), 719-725.
5. Biernjacki, C., Celeux, G., Govaert, G., 2000. Assessing a mixture model for clustering with the integrated classification likelihood. IEEE Trans. Pattern Anal. Machine Intell. 24 (3), 381-396, 22(7), 719-725.
6. Dempster, A.P., Laird, N.M., Rubin, D.B., 1977. Maximum likelihood from incomplete data using the EM algorithm (with discussion). J. Roy. Statist. Soc. Ser. B 39, 1-38.
7. Figueiredo, M.A.T., Jain, A.K., 2002. Unsupervised learning of finite mixture models. IEEE Trans. Pattern Anal. Machine Intell. 24 (3), 381-396.
8. Hansen, M.H., Yu, B., 2001. Model selection and the principle of minimum description length. J. Amer. Statist. Assoc. 96, 746-774.
9. Hartigan, J.A., 1985. A failure of likelihood asymptotics for normal mixtures. In: Proceedings of the Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer, vol. 2, pp. 807-810.
10. Jain, A.K., Duin, R.P.W., Mao, J., 2000. Statistical pattern recognition: A review. IEEE Trans. Pattern Anal. Machine Intell. 22 (1), 4-37.
11. Keribin, C., 2000. Consistent estimation of the order of mixture models. Sankhya Ser. A 62, 49-66.
12. McLachlan, G.J., 1987. On bootstrapping the likelihood ratio test statistic for the number of components in a normal mixture. Appl. Statist. 36, 318-324.
13. McLachlan, G.J., Basford, K.E., 1988. Mixture Models: Inference and Applications to Clustering. Marcel Dekker, New York.
14. McLachlan, G.J., Krishnan, T., 1997. The EM Algorithm and Extensions. Wiley, New York.
15. McLachlan, G.J., Peel, D., 2000. Finite Mixture Models. Wiley, New York.
16. Miloslavsky, M., Laan, M., van der Laan, M.J., 2003. Fitting of mixtures with, unspecified number of components using cross validation distance estimate, Comput. Statist. Data Anal. 41, 413-428.
17. Oliver, J., Baxter, R., Wallace, C., 1996. Unsupervised learning using MML. In: Proc. Thirteenth Internat. Conf. on Machine Learning. Morgan Kaufmann, San Francisco, CA, pp. 364-372.
18. Richardson, S., Green, P.J., 1997. On Bayesian analysis of mixtures with an unknown number of components. J. Roy. Statist. Soc. Ser. B 59, 731-758.
19. Schlattmann, P., 2003. Estimating the number of components in a finite mixture model: The special case of homogeneity. Comput. Statist. Data Anal. 41, 441-451.
20. Schwarz, G., 1978. Estimating the dimension of a model. Ann. Statist. 6, 461-464.
21. Susko, E., 2003. Weighted tests of homogeneity for tesing the number of components in a mixture. Comput. Statist. Data Anal. 41, 367-378.
22. Titterington, D.M., Smith, A.F.M., Makov, U.E., 1985. Statistical Analysis of Finite Mixture Distributions. Wiley, New York.
23. Ueda, N., Nakano, R., 1994. A new competitive learning approach based on an equidistortion principle for designing optimal vector quantizers. Neural Networks 7 (8), 1211-1227.
24. Ueda, N., Nakano, R., 2000a. Split and merge EM algorithm for improving Gaussian mixture density estimates. J. VLSI Signal Process. 26, 133-140.
25. Ueda, N., Nakano, R., Ghahramani, Z., Hinton, G.E., 2000b. SMEM algorithm for mixture models. Neural Comput. 12, 2109-2128.
26. Webb, A.R., 1999. Statistical Pattern Recognition. Oxford, London.
27. Windham, M.P., Cutler, A., 1992. Information ratios for validating mixture analysis. J. Amer. Statist. Assoc. 87, 1188-1192.
28. Windham, M.P., Cutler, A., 1994. Information-based validity functionals for mixture analysis. In: Proc. First US/Japan Conf. on the Frontiers of Statistical Modeling: An Informational Approach. Kluwer Academic Publishers, Dordrecht, pp. 149-170.
29. Yang, X., Liu, J., 2002. Mixture density estimation with group membership functions. Pattern Recognition Lett. 23, 501-512.
30. Zhang, Z., Chen, C., Sun, J., Chan, K.L., 2003. EM algorithms for Gaussian mixtures with split-and-merge operation. Pattern Recognition 36, 1973-1983.