Convergence of the one-dimensional Kohonen algorithm

Advances in Applied Probability

Volumn 30, Issue 3, 1998, Pages 850-869

  Benaïm, Michel ^a,d   Fort, Jean Claude ^b   Pagès, Gilles ^c,e  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

^c UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^d INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

^e University of Paris VII LPSM partially supported by ERC Starting Grant 680275 MALIG   (France)

Author keywords

Cooperative dynamical system; Kohonen algorithm; Stochastic algorithm

Indexed keywords

EID: 0000700547     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0001867800008636     Document Type: Article

References (23)

1. BENAÏM, M. (1996). A dynamical system approach to stochastic approximations. SIAM J. Control Optim. 34, 437-472.
2. BENAÏM, M. (1998). Recursive algorithms, urn processes and chaining number of chain recurrent sets. Ergod. Th. & Dynam. Sys. 18, 53-87.
3. BOUTON, C. AND PAGÈS, G. (1993). Self-organization and convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuli. Stoch. Proc. Appl. 47, 249-274.
4. COHORT, P. (1998). Unicité d'un quantifieur localement optimal par la methode du col, Technical Report, Laboratoire de Probabilités, Université Paris 6, France.
5. CONLEY, C. (1978). Isolated invariant set and the Morse index. Conference Board of the Mathematical Science AMS Regional Conference Series in Mathematics.
6. COTTRELL, M. AND FORT, J. C. (1987). Étude d'un algorithme d'auto-organisation. Ann. Inst. H. Poincaré B 23, 1-20.
7. FLANAGAN, A. (1994). Self-organizing neural networks. Thèse 1306, Ecole Polytechnique de Lausanne.
8. FORT, J. C. AND PAGÈS, G. (1995). On the a.s. convergence of the Kohonen algorithm with a general neighborhood function. Ann. Appl. Prob. 5, 1177-1216.
9. FORT, J. C. AND PAGÈS, G. (1996). About the Kohonen algorithm: strong or weak self-organization? Neural Networks 9, 773-785.
10. FORT, J. C. AND PAGÈS, G. (1996). Convergence of stochastic algorithms: from the Kushner & Clark theorem to the Lyapounov functional method. Adv. Appl. Prob. 28, 1072-1094.
11. FORT, J. C. AND PAGÈS, G. (1996). Asymptotic behaviour of a Markovian stochastic algorithm with constant step. To appear in SIAM J. Control Optimization.
12. GANTMACHER, F. R. (1959). The Theory of Matrices. Vols 1 and 2. Chelsea, New York.
13. HIRSCH, M. (1985). Systems of differential equations which are competitive or cooperative II: convergence almost everywhere. SIAM J. of Math. Anal. 16, 423-439.
14. HIRSCH, M. (1988). Stability and convergence in strongly monotone dynamical systems. J. Reine Angew. Math. 383, 1-53.
15. KOHONEN, T. (1982). Analysis of a simple self-organizing process. Biol. Cybernet. 44, 135-140.
16. KOHONEN, T. (1989). Self-Organization and Associative Memory, 3rd edn. Springer, Berlin.
17. KUNZE, H. AND SIEGEL, D. (1994). A graph theoretic approach to monotonicity with respect to initial conditions. In Comparison Methods and Stability Theory. Eds. X. Liu and D. Siegel. Marcel Dekker, New York.
18. KUSHNER, H. J. AND CLARK, D. S. (1978). Stochastic Approximation for Constrained and Unconstrained Systems. Appl. Math. Sci. Series, 26, Springer, Berlin.
19. MÉTIVIER, M. AND PRIOURET, P. (1987). Théorèmes de convergence presque sûre pour une classe d'algorithmes stochastiques. Prob. Theory Rel. Fields 74, 403-428.
20. MILNOR, J. W. (1969) Topology from the Differential Viewpoint, 2nd edn. University Press of Virginia.
21. RITTER, H. AND SCHULTEN, K. (1988). Convergence properties of Kohonen's topology conserving maps: fluctuation, stability and dimension selection. Biol. Cybernet. 60, 59-71.
22. o 166, Kaiserslautern University, Germany.
23. SMITH, H. L. (1995) Monotone dynamical systems. An introduction to the theory of competitive and cooperative systems. Mathematical Surveys and Monographs 41, AMS, Providence, RI.