Theoretical analysis of the batch variant of the self-organizing feature map algorithm for 1-d networks mapping a continuous 1-d input space

DOI10.1080/00207169808804653zbMath0892.68048OpenAlexW2099182015MaRDI QIDQ4380246

Nikolaos Vassilas

Publication date: 11 March 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804653

zbMATH Keywords

self-organizing feature mapneural algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Self-organization of the batch Kohonen network under quantization effects

Cites Work

• Self-organization and a.s. convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuli
• On the stationary state of Kohonen's self-organizing sensory mapping
• Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
• Self-organization and associative memory.
• Analysis of recursive stochastic algorithms
• Convergence in Distribution of the One-Dimensional Kohonen Algorithms when the Stimuli are not Uniform
• Self-organizing maps.

This page was built for publication: Theoretical analysis of the batch variant of the self-organizing feature map algorithm for 1-d networks mapping a continuous 1-d input space