Fast self-organization by the probing algorithm

Lampinen , Oja Lampinen , Oja
1989 International Joint Conference on Neural Networks 26 citations

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">&gt;</ETX>

Keywords

Self-organizing mapComputer scienceMatching (statistics)Self-organizationAssociative propertyAlgorithmArtificial intelligenceMathematicsArtificial neural network

Affiliated Institutions

Related Publications

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...

1990 Proceedings of the IEEE 8017 citations

Publication Info

Year
1989
Type
article
Pages
503-507 vol.2
Citations
26
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

26
OpenAlex
1
Influential
17
CrossRef

Cite This

Lampinen, Oja (1989). Fast self-organization by the probing algorithm. International Joint Conference on Neural Networks , 503-507 vol.2. https://doi.org/10.1109/ijcnn.1989.118290

Identifiers

DOI
10.1109/ijcnn.1989.118290

Data Quality

Data completeness: 77%