Conjugate and natural gradient rules for byy harmony learning on Gaussian mixture with automated model selection

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 19, Issue 5, 2005, Pages 701-713

  Ma, Jinwen ^a   Gao, Bin ^a   Wang, Yang ^a   Cheng, Qiansheng ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

Automated model selection; Bayesian Ying Yang learning; Conjugate gradient; Gaussian mixture; Natural gradient

Indexed keywords

COMPUTER SIMULATION; HARMONIC ANALYSIS; LEARNING ALGORITHMS; MATHEMATICAL MODELS;

AUTOMATED MODEL SELECTION; BAYESIAN YING-YANG LEARNING; CONJUGATE GRADIENT; GAUSSIAN MIXTURE; NATURAL GRADIENT;

GAUSSIAN NOISE (ELECTRONIC);

EID: 23944438437     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001405004228     Document Type: Article

References (20)

1. H. Akaike, A new look at the statistical model identification, IEEE Trans. Autom. Contr. AC-19 (1974) 716-723.
2. S. Amari and H. Nagaoka, Methods of Information Geometry (American Mathematical Society, Providence, RI, 2000).
3. N. E. Day, Estimating the components of a mixture of normal distributions, Biometrika 56 (1969) 463-474.
4. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis (John Wiley, NY, 1973).
5. H. P. Friedman and J. Rubin, On some invariant criteria, for grouping data, J. Amer. Stat. Assoc. 62 (1967) 1159-1178.
6. S. R. Gerald, Matrix Derivatives (Marcel Dekker, NY, 1980).
7. J. A. Hartigan, Distribution problems in clustering, Classification and Clustering, ed. J. Van Ryzin (Academic Press, NY, 1977), pp. 45-72.
8. J. Ma, and T. Wang, Entropy penalized automated model selection on Gaussian mixture, Int. J. Pattern Recognition and Artificial Intellegence 18 (2004) 1501-1512.
9. J. Ma, T. Wang and L. Xu, An adaptive BYY harmony learning algorithm and its relation to rewarding and penalizing competitive learning mechanism, in Proc. ICSP'02 2 (2002) 1154-1158.
10. J. Ma, T. Wang and L. Xu, A gradient BYY harmony learning rule on Gaussian mixture with automated model selection, Neurocomputing 56 (2004) 481-487.
11. G. W. Millgan and M. C. Copper, An examination of procedures for determining the number of clusters in a data set, Psychometrika 46 (1985) 187-199.
12. R. A. Render and H. F. Walker, Mixture densities, maximum likelihood and the EM algorithm, SIAM Rev. 26 (1984) 195-239.
13. S. J. Robert, R. Everson and I. Rezek, Maximum certainty data partitioning, Patt. Recogn. 33 (2000) 833-839.
14. A. J. Scott and M. J. Symons, Clustering methods based on likelihood ratio criteria, Biometrics 27 (1971) 387-397.
15. N. Vlassis and A. Likas, A greedy EM algorithm for Gaussian mixture learning, Neural Process. Lett. 15 (2002) 77-87.
16. L. Xu, Ying-Yang machine: A Bayesian-Kullback scheme for unified learnings and new results on vector quantization, Proc. 1995 Int. Conf. Neural Information Processing (ICONIP'95) 2 (1995), pp. 977-988.
17. L. Xu, Best harmony, unified RPCL and automated model selection for unsupervised and supervised learning on Gaussian mixtures, three-layer nets and ME-RBF-SVM models, Int. J. Neural Syst. 11 (2001) 43-69.
18. L. Xu, Ying-Yang learning, The Handbook of Brain Theory and Neural Networks, 2nd ed., ed. M. A. Arbib (The MIT Press, Cambridge, MA, 2002), pp. 1231-1237.
19. L. Xu, BYY harmony learning, structural RPCL, and topological self-organzing on mixture modes, Neural Networks 15 (2002) 1231-1237.
20. B. Zhang, C. Zhang and X. Yi, Competitive EM algorithm for finite mixture model, Patt. Recogn. 37 (2004) 131-144.