Abstract

In several applications the information is naturally represented by graphs. Traditional approaches cope with graphical data structures using a preprocessing phase which transforms the graphs into a set of flat vectors. However, in this way, important topological information may be lost and the achieved results may heavily depend on the preprocessing stage. This paper presents a new neural model, called graph neural network (GNN), capable of directly processing graphs. GNNs extends recursive neural networks and can be applied on most of the practically useful kinds of graphs, including directed, undirected, labelled and cyclic graphs. A learning algorithm for GNNs is proposed and some experiments are discussed…

Citation impact

1,890
total citations
FWCI
7.30
Percentile
100%
References
13
Citations per year

Authors

3

Topics & keywords

Keywords
  • Computer science
  • Preprocessor
  • Artificial neural network
  • Theoretical computer science
  • Artificial intelligence
  • Graph
  • Graphical model
  • Undirected graph
No related works found for this paper.