title: Variants of self-organizing maps.
abstract: Self-organizing maps have a bearing on traditional vector quantization. A characteristic that makes them more closely resemble certain biological brain maps, however, is the spatial order of their responses, which is formed in the learning process. A discussion is presented of the basic algorithms and two innovations: 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 minimal 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 process, it is necessary to fine tune the reference vectors so that they directly define the decision borders.
authors.affiliation: Lab. of Comput. and Inf. Sci., Helsinki Univ. of Technol., Espoo.
authors.forename: J A
authors.initials: JA
authors.lastname: Kangas
authors.forename: T K
authors.initials: TK
authors.lastname: Kohonen
authors.forename: J T
authors.initials: JT
authors.lastname: Laaksonen