Convergence of one-dimensional self-organizing map

Analyzes the convergence property of the one-dimensional self-organizing map (SOM). The key of the proof is the application of Ljung's theorem [1977]. With the aid of the theorem, the authors can conclude that convergence of the one dimensional self-organizing map is almost certain if the following conditions are fulfilled, (i) the map is initial in order, (ii) the neighborhood interacting function (NIF) is non-increasing outward throughout the neighborhood interacting set (NIS) and (iii) the input distribution is stationary. Note that these conditions are less restrictive than those obtained previously in two folds: (i) there is no limit on the size of the NIS and (ii) the input distribution is not required to be uniform.<<ETX>>

[1]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[2]  C. Malsburg,et al.  How patterned neural connections can be set up by self-organization , 1976, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[3]  Tharam S. Dillon,et al.  Convergence of self-organizing neural algorithms , 1992, Neural Networks.

[4]  D J Willshaw,et al.  A marker induction mechanism for the establishment of ordered neural mappings: its application to the retinotectal problem. , 1979, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.

[5]  Stephen P. Luttrell Code vector density in topographic mappings: Scalar case , 1991, IEEE Trans. Neural Networks.

[6]  Zhen-Ping Lo,et al.  Analysis of the convergence properties of topology preserving neural networks , 1993, IEEE Trans. Neural Networks.

[7]  Lennart Ljung,et al.  Analysis of recursive stochastic algorithms , 1977 .