Gaussian mixture learning via robust competitive agglomeration

Pattern Recognition Letters

Volumn 31, Issue 7, 2010, Pages 539-547

  Lu, Zhiwu ^a,b   Peng, Yuxin ^a   Ip, Horace H S ^b  

^a PEKING UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Asymptotic analysis; Competitive agglomeration; Gaussian mixtures; Model selection

Indexed keywords

AUTOMATIC MODEL SELECTION; EM ALGORITHMS; GAUSSIAN MIXTURES; LOCAL OPTIMA; MODEL SELECTION; MULTIVARIATE DATA; NUMBER OF COMPONENTS; ROBUST ALGORITHM; THEORETIC ANALYSIS;

AGGLOMERATION; ARRAY PROCESSING; CLUSTERING ALGORITHMS; GAUSSIAN DISTRIBUTION; LEARNING ALGORITHMS; MIXTURES;

ASYMPTOTIC ANALYSIS;

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

References (26)

1. Bouguila N., and Ziou D. Unsupervised selection of a finite Dirichlet mixture model: An MML-based approach. IEEE Trans. Knowledge Data Eng. 18 8 (2006) 993-1009
2. Brand M. Structure learning in conditional probability models via entropic prior and parameter extinction. Neural Computat. 11 5 (1999) 1155-1182
3. Carson, C., Belongie, S., Hellerstein, H.G., Malik, J., 2002. Blobworld: image segmentation using expectation-maximization and its application to image querying. IEEE Trans. Pattern Anal. Machine Intell. 24(8), 1026-1038.
4. de Carvalho F. Fuzzy c-means clustering methods for symbolic interval data. Pattern Recognition Lett. 28 4 (2007) 423-437
5. Diplaros A., Vlassis N., and Gevers T. A spatially constrained generative model and an EM algorithm for image segmentation. IEEE Trans. Neural Networks 18 3 (2007) 798-808
6. Figueiredo M.A.T., and Jain A.K. Unsupervised learning of finite mixture models. IEEE Trans. Pattern Anal. Machine Intell. 24 3 (2002) 381-396
7. Frigui H., and Krishnapuram R. Clustering by competitive agglomeration. Pattern Recognition 30 7 (1997) 1109-1119
8. Grira, N., Crucianu, M., Boujemaa, N., 2005. Semi-supervised fuzzy clustering with pairwise-constrained competitive agglomeration. In: Proc. 14th IEEE Internat. Conf. on Fuzzy Systems, pp. 867-872.
9. Hajji H. Statistical analysis of network traffic for adaptive faults detection. IEEE Trans. Neural Networks 16 5 (2005) 1053-1063
10. Hubert L., and Arabie P. Comparing partitions. J. Classification 2 1 (1985) 193-218
11. Hull J.J. A database for handwritten text recognition research. IEEE Trans. Pattern Anal. Machine Intell. 16 5 (1994) 550-554
12. Hung W.-L., Yang M.-S., and Chen D.-H. Bootstrapping approach to feature-weight selection in fuzzy c-means algorithms with an application in color image segmentation. Pattern Recognition Lett. 29 9 (2008) 1317-1325
13. Kato Z. Segmentation of color images via reversible jump MCMC sampling. Image Vision Comput. 26 3 (2008) 361-371
14. Marsland S., Twining C.J., and Taylor C.J. A minimum description length objective function for groupwise non-rigid image registration. Image Vision Comput. 26 3 (2008) 333-346
15. Martin, D., Fowlkes, C., Tal, D., Malik, J., 2001. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Internat. Conf. on Computer Vision, pp. 416-423.
16. McLachlan G.J. On bootstrapping the likelihood ratio test statistic for the number of components in a normal mixture. Appl. Statist. 36 3 (1987) 318-324
17. McLachlan G.J., and Khan N. On a resampling approach for tests on the number of clusters with mixture model-based clustering of tissue samples. J. Multivariate Anal. 90 1 (2004) 90-105
18. In: McLachlan G.J., and Krishnan T. (Eds). The EM Algorithm and Extensions (1997), Wiley, New York
19. Persson D., Eriksson T., and Hedelin P. Packet video error concealment with gaussian mixture models. IEEE Trans. Image Process. 17 2 (2008) 145-154
20. Rand W.M. Objective criteria for the evaluation of clustering methods. J. Amer. Statist. Associat. 66 336 (1971) 846-850
21. Render R.A., and Walker H.F. Mixture densities, maximum likelihood and the EM algorithm. SIAM Rev. 26 2 (1984) 195-239
22. Rissanen J. Modeling by shortest data description. Automatica 14 5 (1978) 465-471
23. Roberts S., Holmes C., and Denison D. Minimum-entropy data partitioning using reversible jump Markov chain Monte Carlo. IEEE Trans. Pattern Anal. Machine Intell. 23 8 (2001) 909-914
24. Unnikrishnan R., Pantofaru C., and Hebert M. Toward objective evaluation of image segmentation algorithms. IEEE Trans. Pattern Anal. Machine Intell. 29 6 (2007) 929-944
25. Utsugi A., and Kumagai T. Bayesian analysis of mixtures of factor analyzers. Neural Computat. 13 5 (2001) 993-1002
26. Wallace C.S., and Dowe D.L. Minimum message length and Kolmogorov complexity. Comput. J. 42 4 (1999) 270-283