Title :
Fast self-organization by the probing algorithm
Author :
Lampinen, J. ; Oja, E.
Author_Institution :
Dept. of Inf. Technol., Lappeenranta Univ. of Technol., Finland
Abstract :
A new computational algorithm, the probing algorithm, is introduced for the subproblem of finding the best matching unit in Kohonen´s self-organization procedure (Self-Organization and Associative Memory, Springer-Verlag, 1988). It is compared to exhaustive search and to four other algorithms and shown to be roughly six to 10 times faster for the case of high-dimensional vectors.<>
Keywords :
adaptive systems; algorithm theory; content-addressable storage; neural nets; Kohonen´s self-organization procedure; computational algorithm; exhaustive search; high-dimensional vectors; matching unit; probing algorithm; self-organization; Adaptive systems; Algorithms; Associative memories; Neural networks;
Conference_Titel :
Neural Networks, 1989. IJCNN., International Joint Conference on
Conference_Location :
Washington, DC, USA
DOI :
10.1109/IJCNN.1989.118290
