Fast Computation of Kohonen Self-Organization

A new computational algorithm, the Probing Algorithm, is introduced for the subproblem of finding the best matching unit in Kohonen’s self-organization procedure. It is compared to exhaustive search and four other algorithms, and shown to be roughly 6 to 10 times faster for the case of high-dimensional vectors.

[1]  Forest Baskett,et al.  An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

[2]  P. Koikkalainen,et al.  Specification and implementation environment for neural networks using communicating sequential processes , 1988, IEEE 1988 International Conference on Neural Networks.

[3]  Stephen M. Omohundro,et al.  Efficient Algorithms with Neural Network Behavior , 1987, Complex Syst..

[4]  Song B. Park,et al.  A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Teuvo Kohonen,et al.  Self-Organization and Associative Memory , 1988 .

[6]  Behrooz Kamgar-Parsi,et al.  An improved branch and bound algorithm for computing k-nearest neighbors , 1985, Pattern Recognit. Lett..

[7]  Thomas P. Yunck,et al.  A Technique to Identify Nearest Neighbors , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.