This paper introduces a novel approach to Self-Organizing Maps which is capable of processing graphs such that the context of vertices and sub-graphs are considered in the mapping process. The result is that any vertex in a graph is mapped onto an n-dimensional map depending on its label and the graph structure as a whole. Experimental results demonstrate that the proposed approach achieves the desired outcomes.
Contextual Processing of Graphs Using Self-Organizing Maps
SPERDUTI, ALESSANDRO;
2005
Abstract
This paper introduces a novel approach to Self-Organizing Maps which is capable of processing graphs such that the context of vertices and sub-graphs are considered in the mapping process. The result is that any vertex in a graph is mapped onto an n-dimensional map depending on its label and the graph structure as a whole. Experimental results demonstrate that the proposed approach achieves the desired outcomes.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
