In this chapter, we will show how an agent based on artificial neural networks (ANNs) can be designed in order to naturally process structured input data en- coded as graphs. Graph Neural Networks (GNNs) [23] are an extension of classical MultiLayer Perceptrons (MLPs) that accept input data encoded as general undi- rected/directed labeled graphs. GNNs are provided with a supervised learning al- gorithm that, beside the classical input-output data fitting measure, incorporates a criterion aimed at the development of a contractive dynamics, in order to properly process the cycles in the input graph. A GNN processes a graph in input and it can be naturally employed to compute an output for each node in the graph (node–focused computation). The training examples are provided as graphs for which supervisions are given as output target values for a subset of their nodes. This processing scheme can be adapted to perform a graph–based computation in which only one output is computed for the whole graph.

Bianchini, M., Maggini, M. (2013). Supervised Neural Network Models for Processing Graphs. In Handbook on Neural Information Processing (pp. 67-96). Berlin Heidelberg : Springer Berlin Heidelberg [10.1007/978-3-642-36657-4_3].

Supervised Neural Network Models for Processing Graphs

BIANCHINI, MONICA;MAGGINI, MARCO
2013-01-01

Abstract

In this chapter, we will show how an agent based on artificial neural networks (ANNs) can be designed in order to naturally process structured input data en- coded as graphs. Graph Neural Networks (GNNs) [23] are an extension of classical MultiLayer Perceptrons (MLPs) that accept input data encoded as general undi- rected/directed labeled graphs. GNNs are provided with a supervised learning al- gorithm that, beside the classical input-output data fitting measure, incorporates a criterion aimed at the development of a contractive dynamics, in order to properly process the cycles in the input graph. A GNN processes a graph in input and it can be naturally employed to compute an output for each node in the graph (node–focused computation). The training examples are provided as graphs for which supervisions are given as output target values for a subset of their nodes. This processing scheme can be adapted to perform a graph–based computation in which only one output is computed for the whole graph.
2013
9783642366567
9783642366574
Bianchini, M., Maggini, M. (2013). Supervised Neural Network Models for Processing Graphs. In Handbook on Neural Information Processing (pp. 67-96). Berlin Heidelberg : Springer Berlin Heidelberg [10.1007/978-3-642-36657-4_3].
File in questo prodotto:
File Dimensione Formato  
ISRL 49 Chapter.pdf

non disponibili

Tipologia: Post-print
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 856.83 kB
Formato Adobe PDF
856.83 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/44616
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo