DocumentCode
3232188
Title
Variants of self-organizing maps
Author
Kangas, Jari ; Kohonen, Teuvo ; Laaksonen, Jorma ; Simula, Olli ; Ventä, Olli
Author_Institution
Lab. of Comput. & Inf. Sci., Helsinki Univ. of Technol., Espoo, Finland
fYear
1989
fDate
0-0 1989
Firstpage
517
Abstract
Self-organizing maps have a connection with traditional vector quantization. A characteristic which makes them resemble certain biological brain maps, however, is the spatial order of their responses which is formed in the learning process. Two innovations are discussed: dynamic weighting of the input signals at each input of each cell, which improves the ordering when very different input signals are used, and definition of neighborhoods in the learning algorithm by the minimum spanning tree, which provides a far better and faster approximation of prominently structured density functions. It is cautioned that if the maps are used for pattern recognition and decision processes, it is necessary to fine-tune the reference vectors such that they directly define the decision borders.<>
Keywords
adaptive systems; brain models; learning systems; trees (mathematics); biological brain maps; decision borders; decision processes; density functions; dynamic weighting; learning process; minimum spanning tree; neighborhoods; pattern recognition; reference vectors; self-organizing maps; spatial order; vector quantization; Adaptive systems; Brain modeling; Learning systems; Trees (graphs);
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1989. IJCNN., International Joint Conference on
Conference_Location
Washington, DC, USA
Type
conf
DOI
10.1109/IJCNN.1989.118292
Filename
118292
Link To Document