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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Affiliated Institutions
Related Publications
Self-organisation: a derivation from first principles of a class of learning algorithms
A novel derivation of T. Kohonen's topographic mapping learning algorithm (Self-Organization and Associative Memory, Springer-Verlag, 1984) is presented. Thus the author prescri...
The self-organizing map
The self-organized map, an architecture suggested for artificial neural networks, is explained by presenting simulation experiments and practical applications. The self-organizi...
Enhancing supervised learning algorithms via self-organization
A neural network processing scheme is proposed which utilizes a self-organizing Kohonen feature map as the front end to a feedforward classifier network. The results of a series...
Reducing transmission error effects using a self-organizing network
The author shows that a Kohonen self-organizing network can be used to reduce the effects of errors in digital transmission of speech, Kohonen learning is used to cause the netw...
On the use of backpropagation in associative reinforcement learning
A description is given of several ways that backpropagation can be useful in training networks to perform associative reinforcement learning tasks. One way is to train a second ...
Publication Info
- Year
- 1989
- Type
- article
- Pages
- 503-507 vol.2
- Citations
- 26
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/ijcnn.1989.118290