Self-organizing map with input data represented as graph

Authors:
Takeshi Yamakawa;Keiichi Horio;Masaharu Hoshino
Affiliations:
Graduate school of Life Science and Systems Engineering, Kyushu Institute of Technology, Fukuoka, Japan;Graduate school of Life Science and Systems Engineering, Kyushu Institute of Technology, Fukuoka, Japan;Ricoh Co., Ltd
Venue:
ICONIP'06 Proceedings of the 13 international conference on Neural Information Processing - Volume Part I
Year:
2006

Citing 3
Cited 1

Topology representing networks

Neural Networks
Self-Organizing Maps

Self-Organizing Maps
SOM of SOMs: self-organizing map which maps a group of self-organizing maps

ICANN'05 Proceedings of the 15th international conference on Artificial Neural Networks: biological Inspirations - Volume Part I

An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

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.