title: Asymmetric neighborhood functions accelerate ordering process of self-organizing maps.
abstract: A self-organizing map (SOM) algorithm can generate a topographic map from a high-dimensional stimulus space to a low-dimensional array of units. Because a topographic map preserves neighborhood relationships between the stimuli, the SOM can be applied to certain types of information processing such as data visualization. During the learning process, however, topological defects frequently emerge in the map. The presence of defects tends to drastically slow down the formation of a globally ordered topographic map. To remove such topological defects, it has been reported that an asymmetric neighborhood function is effective, but only in the simple case of mapping one-dimensional stimuli to a chain of units. In this paper, we demonstrate that even when high-dimensional stimuli are used, the asymmetric neighborhood function is effective for both artificial and real-world data. Our results suggest that applying the asymmetric neighborhood function to the SOM algorithm improves the reliability of the algorithm. In addition, it enables processing of complicated, high-dimensional data by using this algorithm.
authors.affiliation: Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan. kaiichiro@acs.i.kyoto-u.ac.jp
authors.forename: Kaiichiro
authors.initials: K
authors.lastname: Ota
authors.forename: Takaaki
authors.initials: T
authors.lastname: Aoki
authors.forename: Koji
authors.initials: K
authors.lastname: Kurata
authors.forename: Toshio
authors.initials: T
authors.lastname: Aoyagi
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D044962:Data Compression / Q000379:methods*; D008962:Models, Theoretical