About the convergence of the generalized Kohonen algorithm
The Kohonen algorithm was originally devised and studied by Kohonen in 1982 (see , ). Unfortunately, as far as mathematical treatment is concerned, rigourous results are not so easy to establish. For instance, any simulation in a one dimensional setting (i.e. with scalar inputs) shows the existence of a self-organization property. Nevertheless, the proof of such a property requires some non trivial Markov material. It was first carried out in  for uniformly distributed stimuli and then was extended to general distributions in . Many open questions related to the one dimensional self-organization still remain, and no similar result was proved in higher dimension so far.
Unable to display preview. Download preview PDF.
- J.C. Fort, G. Pagès, Sur la convergence p.s. de l’algorithme de Kohonen gènèralisè, note aux CRAS, sèrie I, 1993,317, p.389–394 (a detailed paper is scheduled)Google Scholar
- T. Kohonen, Self-organizing maps: optimization approaches, Artificial Neural Networks, T. Kohonen et al. ed., Elsevier Science Publishers B.V., 1991, p.981- 990.Google Scholar
- H.J. Kushner, D.S. Clark, Stochastic Approximation for constrained and unconstrained systems, Applied Math. Science Series, 26, Springer, 1978.Google Scholar