Probabilistic self-organizing map and radial basis function networks

Neurocomputing

Volumn 20, Issue 1-3, 1998, Pages 83-96

  Anouar, F ^a   Badran, F ^a   Thiria, S ^a,b  

^a Unité de Recherches Mesures Physiques Métrologie   (France)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Dynamic clusters; Likelihood; Radial basis function; Regression; Self organizing map

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; LEARNING ALGORITHMS; LEARNING SYSTEMS; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; REGRESSION ANALYSIS; TOPOLOGY;

NORMALIZED GAUSSIAN BASIS FUNCTION (NGBF) ALGORITHMS; PROBABILISTIC SELF-ORGANIZING MAP (PRSOM) ALGORITHMS; RADIAL BASIS FUNCTION (RBF) NETWORKS;

FEEDFORWARD NEURAL NETWORKS;

ALGORITHM; ARTICLE; MATHEMATICAL ANALYSIS; NERVE CELL NETWORK; PRIORITY JOURNAL; SIGNAL TRANSDUCTION;

EID: 0032584958     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-2312(98)00026-5     Document Type: Article

References (17)

1. M. Benaim, On functional approximation with normalized Gaussian units, Neural Comput. 6 (1994).
2. Bishop C. Neural networks for pattern recognition. 1995;Oxford University Press, Oxford.
3. C. Bishop M. Svensen, C. Williams, GTM: a principled alternative to the Self Organizing Map, ICANN 96.
4. G. Celeux, J. Diebolt, Reconnaissance de mélange de densité et classification, un algorithme d'apprentissage probabiliste: l'algorithme SEM, Report INRIA, 1984.
5. A.P. Dempster, N.M. Laird, D. Rubin, Maximum likelihood from incomplete data via the EM algorithm, J. Roy. Statist. Soc. B 39 (1977) 1-38.
6. E. Diday, J.C. Simon, Clustering analysis, in: K.S. Fu (Ed.), Digital pattern recognition, Springer, New York 1976.
7. Fritzke B. Growing cell structures, A self organizing network for unsupervised and supervised learning. Neural Networks. 7:1994;1441-1460.
8. E. Hartman, J.D. Keeler, J. Kowalski, Layered neural networks with gaussian hidden units are universal approximators, Neural Comput. 2 (1990).
9. Kohonen T. Self-Organizing Maps. 1994;Springer, Berlin.
10. S.P. Luttrel, A bayesian analysis of self-organizing maps, Neural Comput. 6 (1994).
11. J. Moody, C. Darken, Fast learning in networks of locally-tuned processing units, Neural Comput. 1 (1989).
12. Niyogi P., Girosi F. On the relationship between generalization error hypothesis complexity, and sample complexity for radial basis functions. Neural Comput. 8:1996;819-842.
13. S. Nowlan, Maximum likelihood competitive learning, Proc. Neural Inform. Process. Systems (1990) 574-582.
14. Sanchez A. Robustization of a learning method for RBF networks. Neurocomput. 9:1995;85-94.
15. A. Schroeder, Analyse d'un mélange de distribution de probabilité de m ê me type, RSA 24 (1) (1976).
16. Xu L., Jordan M.I. On convergence properties of the EM algorithm for gaussians mixtures. Neural Comput. 8:1996;129-151.
17. Xu L., Krzyzak A., Yuille A. On radial basis function nets and kernel regression. statistical consistency, convergence rates, and receptive field size Neural Networks. 7(4):1994;609-828.