about
A Comprehensive Survey on Graph Neural Networks (2019) (arxiv.org)
19 points by painful on Jan 7, 2019 | hide | past | pdf | discuss on HN

In plain words: Graph neural networks learn from data shaped like networks, such as molecules, social circles, and road maps, where ordinary deep learning struggles. This survey sorts the field into four families, maps their real-world uses, and lays out open problems and future directions.

Abstract · A Comprehensive Survey on Graph Neural Networks

Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art graph neural networks into four categories, namely recurrent graph neural networks, convolutional graph neural networks, graph autoencoders, and spatial-temporal graph neural networks. We further discuss the applications of graph neural networks across various domains and summarize the open source codes, benchmark data sets, and model evaluation of graph neural networks. Finally, we propose potential research directions in this rapidly growing field.

Zonghan Wu, Shirui Pan, Fengwen Chen, Guodong Long, Chengqi Zhang, Philip S. Yu
arXiv:1901.00596 · cs.LG, stat.ML · submitted Jan 3, 2019 · updated Dec 4, 2019
abstract · pdf · html · Minor revision (updated tables and references)

add comment on HN