An improved algorithm for Kohonen's self-organizing feature maps

A modified algorithm is presented for the learning by self-organizing topology-preserving maps to improve the piecewise-correct problem that arose frequently with the original self-organizing maps. The problem is generally caused by two dominant factors existing in the learning procedure of the original algorithm. One is the initial-sequence-order problem. The present algorithm efficiently reduces the influence of these two factors and successfully guides the network to form a topologically correct map. The proposed algorithm adopts a dynamic network that allows cells to be inserted and deleted, and it adds the Coulomb effect to the learning factor. Simulation results indicate that the modified algorithm performs well in learning the mapping of a two-dimensional input vector distribution using a one-dimensional network.<<ETX>>

[1]  Helge Ritter,et al.  Extending Kohonens Self-Organizing Mapping Algorithm to Learn Ballistic Movements , 1988 .

[2]  Teuvo Kohonen,et al.  The self-organizing map , 1990 .

[3]  Teuvo Kohonen,et al.  The 'neural' phonetic typewriter , 1988, Computer.

[4]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[5]  Duane DeSieno,et al.  Adding a conscience to competitive learning , 1988, IEEE 1988 International Conference on Neural Networks.

[6]  Chau-Yun Hsu,et al.  A study of feature-mapped approach to the multiple travelling salesmen problem , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[7]  C. L. Scofield.  Learning internal representations in the Coulomb energy network , 1988, IEEE 1988 International Conference on Neural Networks.