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>
No takes yet. Share an insight, caveat, or question.
Lampinen et al. (1989) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: