About the multidimensional competitive learning vector quantization algorithm with constant gain

Annals of Applied Probability

Volumn 7, Issue 3, 1997, Pages 679-710

  Bouton, Catherine ^a   Pagès, Gilles ^b,c  

^a University Paris I Sorbonne Panthéon   (France)

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

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

Author keywords

Markov chain; Neural networks; Uniform ergodicity; Vector quantization

Indexed keywords

EID: 0031488780     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1034801249     Document Type: Article

References (24)

1. BENVENISTE, A., MÉTIVIER, M. and PRIOURET, P. (1987). Algorithmes Adaptatifs et Approximations Stochastiques. Masson, Paris.
2. BOUTON, C. and PAGÈS, G. (1993). Self-organization and convergence of the one-dimensional Kohonen algorithm with nonuniformly distributed stimuli. Stochastic Process. Appl. 47 249-274.
3. BOUTON, C. and PAGÈS, G. (1994). Convergence in distribution of the 1-dimensional Kohonen algorithms when the stimuli are not uniform. Adv. in Appl. Probab. 26 80-103.
4. BOUTON, C. and PAGÈS, G. (1994). Convergence in distribution of the multi-dimensional Kohonen algorithm with 0 neighbor. Technical Report 259, Univ. Paris 6.
5. BURTON, R. M. and FARIS, W. G. (1996). A self-organizing cluster process. Ann. Appl. Probab. 6 1232-1247.
6. COHORT, P. (1997). Unicité d'un quantifieur optimal par le théorème du col. Technical report, Univ. Paris 6.
7. COTTRELL, M. and FORT, J. C. (1987). Etude d'un algorithme d'auto-organisation. Ann. Inst. H. Poincaré Sér. B 23 1-20.
8. DOOB, J. L. (1953). Stochastic Processes. Wiley, New York.
9. DUFLO, M. (1990). Méthodes Récursives Aléatoires. Masson, Paris.
10. FLANAGAN, J. A. (1994). Self-organizing neural networks. Ph.D. dissertation. Ecole Polytechnique Fédérale de Lausanne.
11. FORT, J. C. and PAGÈS, G. (1995). On the a.s. convergence of the Kohonen algorithm with a general neighborhood function. Ann. Appl. Probab. 5 1177-1216.
12. FORT, J. C. and PAGÈS, G. (1996). Asymptotics of the invariant distribution of a stochastic algorithm with constant step. Technical Report 324, Univ. Paris 6.
13. GRAY, R. M. ed. (1982). Special issue on quantization. IEEE Trans. Inform. Theory 28 127-394.
14. KIEFFER, J. C. (1982). Exponential rate of convergence for Lloyd's method I. IEEE Trans. Inform. Theory 28 205-210.
15. KOHONEN, T. (1982). Analysis of a simple self-organizing process. Biol. Cybernet. 44 135-140.
16. KOHONEN, T. (1984). Self-Organization and Associative Memory. Springer, New York.
17. KOHONEN, T. (1991). Self-organizing maps: optimization approaches. In Artificial Neural Networks (T. Kohonen, et al., eds.) 981-990. North-Holland, Amsterdam.
18. KUSHNER, H. J. and CLARK, D. S. (1978). Stochastic Approximation for Constrained and Unconstrained Systems. Springer, New York.
19. LAMBERTON, D. and PAGÈS, G. (1996). On the critical points of the one-dimensional competitive learning vector quantization algorithm. Proceedings ESANN 1996 97-102.
20. MEYN, S. P. and TWEEDIE, R. L. (1993). Markov Chains and Stochastic Stability. Springer, New York.
21. PAGÈS, G. (1993). Voronoi tessellation, space quantization algorithms and numerical integration. Proceedings ESANN 1993 221-228.
22. REVUZ, D. (1975). Markov Chains. North-Holland, Amsterdam.
23. SARZEAUD, O., STÉPHAN, Y. and TOUZET, C. (1990). Application des cartes auto-organisatrices à la génération de maillages aux éléments finis. Proceedings of Neuro-Nîmes 1 81-96.
24. TRUSHKIN, A. V. (1982). Sufficient conditions for uniqueness of a locally optimal quatizer for a class of convex error weighting functions. IEEE Trans. Inform. Theory 28 187-198.