The graph neural network model.

  • Scarselli F
  • Gori M
  • Tsoi A
 et al. 
  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Many underlying relationships among data in several areas of science and engineering, e.g., computer vision, molecular chemistry, molecular biology, pattern recognition, and data mining, can be represented in terms of graphs. In this paper, we propose a new neural network model, called graph neural network (GNN) model, that extends existing neural network methods for processing the data represented in graph domains. This GNN model, which can directly process most of the practically useful types of graphs, e.g., acyclic, cyclic, directed, and undirected, implements a function tau(G,n) is an element of IR(m) that maps a graph G and one of its nodes n into an m-dimensional Euclidean space. A supervised learning algorithm is derived to estimate the parameters of the proposed GNN model. The computational cost of the proposed algorithm is also considered. Some experimental results are shown to validate the proposed learning algorithm, and to demonstrate its generalization capabilities.

Author-supplied keywords

  • Algorithms
  • Artificial Intelligence
  • Automated
  • Databases
  • Factual
  • Internet
  • Linear Models
  • Neural Networks (Computer)
  • Nonlinear Dynamics
  • Pattern Recognition
  • Regression Analysis
  • Reproducibility of Results

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Franco Scarselli

  • Marco Gori

  • Ah Chung Tsoi

  • Markus Hagenbuchner

  • Gabriele Monfardini

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free