An algorithm for estimating number of components of gaussian mixture model based on penalized distance

2008 IEEE International Conference Neural Networks and Signal Processing, ICNNSP

Volumn , Issue , 2008, Pages 482-487

  Zhang, Daming ^a,b   Guo, Hui ^c   Luo, Bin ^a  

^a ANHUI UNIVERSITY   (China)

^b ANHUI JIANZHU UNIVERSITY   (China)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Finite mixture model; Greedy EM; Number of components; Parzen window; Penalized minimum matching distance

Indexed keywords

ARTIFICIAL INTELLIGENCE; BLIND SOURCE SEPARATION; COMMUNICATION CHANNELS (INFORMATION THEORY); ESTIMATION; IMAGE SEGMENTATION; MIXTURES; NEURAL NETWORKS; OBJECT RECOGNITION; PARAMETER ESTIMATION; SIGNAL PROCESSING; TRELLIS CODES;

BIVARIATE; E-M ALGORITHMS; EXPECTATION-MAXIMIZATION ALGORITHMS; FINITE MIXTURE MODEL; FINITE MIXTURE MODELS; GAUSSIAN MIXTURE MODEL; GAUSSIAN MIXTURE MODELING; GREEDY EM; INTERNATIONAL CONFERENCES; NUMBER OF COMPONENTS; PARZEN WINDOW; PENALIZED MINIMUM MATCHING DISTANCE; UNIVARIATE;

ALGORITHMS;

EID: 51849113242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNNSP.2008.4590397     Document Type: Conference Paper

References (11)

1. Figueiredo M.A.T., and Jain A.K., "Unsupervised learning of finite mixture models", IEEE Trans Pattern Analysis and Machine Intelligence, Vol. 24, No.3, pp.381-396,2002 March.
2. G. J. McLachlan and D. Peel, Finite Mixture Models. Wiley, New York,2000
3. A. Dempster, N. Laird, and D. Rubin, "Maximum Likelihood Estimation from Incomplete Data via the EM Algorithm", J. royal Statistical Soc. B, Vol.39, pp.1-38,1977.
4. G. J. McLachlan and T. Krishnan, The EM Algorithm and Extensions, Wiley, New York,1997.
5. H. Akaike, "A new look at statistical model identification", IEEE Trans. on Automatic Control, Vol.19, pp.716-723, 1974.
6. H.X. Wang, B.Luo, Q. B. Zhang and S.Wei, "Estimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm", Pattern Recognition Letters, Vol.25, pp. 1799-1809,2004.
7. S.B.Chen and B.Luo, "Robust T-mixture Modeling with SMEM Algorithm", Proceedings of the Third International Conference on Machine Learning and Cybernetics, Shanghai, pp. 3689-3694, August 2004.
8. N. Vlassis and A. Likas, "A greedy EM algorithm for Gaussian mixture learning", Neural Processing Letters. Vol.15, No.1, pp.77-87,2002.
9. J. J. Verbeek, N. Vlassis and B. Krose. "Efficient Greedy Learning of Gaussian Mixture Models". Neural Computation, Vol.5, No.2, pp.469-485,2003.
10. W. Luo. "Penalized minimum matching distance-guided EM algorithm". Int. J. electron. Commun.(AEU). Vol.60, pp.235-239,2006.
11. R. O. Duda, P. E. Hart and D. G. Stork. Pattern Classification, second. Wiley, New York,2001