A gentle introduction to deep learning for graphs

被引：175

作者：

Bacciu, Davide ^{[1
]}

Errica, Federico ^{[1
]}

Micheli, Alessio ^{[1
]}

Podda, Marco ^{[1
]}

机构：

[1] Univ Pisa, Dept Comp Sci, Pisa, Italy

来源：

NEURAL NETWORKS | 2020年 / 129卷

关键词：

Deep learning for graphs; Graph neural networks; Learning for structured data; CASCADE CORRELATION; GENERAL FRAMEWORK; NEURAL-NETWORKS; CLASSIFICATION;

D O I：

10.1016/j.neunet.2020.06.006

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The adaptive processing of graph data is a long-standing research topic that has been lately consolidated as a theme of major interest in the deep learning community. The snap increase in the amount and breadth of related research has come at the price of little systematization of knowledge and attention to earlier literature. This work is a tutorial introduction to the field of deep learning for graphs. It favors a consistent and progressive presentation of the main concepts and architectural aspects over an exposition of the most recent literature, for which the reader is referred to available surveys. The paper takes a top-down view of the problem, introducing a generalized formulation of graph representation learning based on a local and iterative approach to structured information processing. Moreover, it introduces the basic building blocks that can be combined to design novel and effective neural models for graphs. We complement the methodological exposition with a discussion of interesting research challenges and applications in the field. (C) 2020 Elsevier Ltd. All rights reserved.

引用

页码：203 / 221

页数：19

共 146 条

[51] Graph self-organizing maps for cyclic and unbounded graphs [J].