Self-organization and a.s. convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuli

  • Gilles Pagks
  • Published 2001


This paper shows that the 2-neighbour Kohonen algorithm is self-organizing under pretty general assumptions on the stimuli distribution p (supp(~~) contains a non-empty open set) and is a.s. convergent-in a weakened sense-as soon as p admits a log-concave density. The 0-neighbour algorithm is shown to have similar converging properties. Some numerical… (More)


3 Figures and Tables

Slides referencing similar topics