Abstract
This paper proposes a new method of Self-Organizing Map (SOM) in which an input space is represented as a graph by modifications of a distance measure and a updating rule. The distance between input node and reference element is defined by the shortest distance between them in the graph. The reference elements are updated along the shortest path to the input node. The effectiveness of the proposed method is verified by applying it to a Traveling Salesman Problem. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Yamakawa, T., Horio, K., & Hoshino, M. (2006). Self-organizing map with input data represented as graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4232 LNCS, pp. 907–914). Springer Verlag. https://doi.org/10.1007/11893028_101
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
