Asymmetric neighborhood functions accelerate ordering process of self-organizing maps
- Graduate School of Informatics, Kyoto University, Kyoto 606-8501 (Japan)
- Faculty of Engineering, University of the Ryukyus, Okinawa 903-0213 (Japan)
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.
- OSTI ID:
- 21560028
- Journal Information:
- Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics (Print), Vol. 83, Issue 2; Other Information: DOI: 10.1103/PhysRevE.83.021903; (c) 2011 American Institute of Physics; ISSN 1539-3755
- Country of Publication:
- United States
- Language:
- English
Similar Records
New Angle on the Parton Distribution Functions: Self-Organizing Maps
Application of materials informatics to vapor-grown carbon nanofiber/vinyl ester nanocomposites through self-organizing maps and clustering techniques