Fast self-organization by the probing algorithm
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 503-507 vol.2
- https://doi.org/10.1109/ijcnn.1989.118290
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
This publication has 7 references indexed in Scilit:
- Self-Organization and Associative MemoryPublished by Springer Nature ,1988
- Specification and implementation environment for neural networks using communicating sequential processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered PartitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1986
- An improved branch and bound algorithm for computing k-nearest neighborsPattern Recognition Letters, 1985
- A Technique to Identify Nearest NeighborsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An Algorithm for Finding Nearest NeighborsIEEE Transactions on Computers, 1975
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975