A Comprehensive Survey on Graph Neural Networks
Abstract
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 the existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this article, 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 GNNs into four categories, namely, recurrent GNNs, convolutional GNNs, graph autoencoders, and spatial–temporal GNNs. We further discuss the applications of GNNs across various domains and summarize the open-source codes, benchmark data sets, and model evaluation of GNNs. Finally, we propose potential research directions in this rapidly growing field.
Cited in this thesis
Frequently Cited Together
- Fishers' preference for mobile traceability platform: challenges in achieving a 2 chapters
- An analytical and machine learning approach for total mercury and methylmercury 2 chapters
- Attention is all you need2 chapters
- Enhancing Livestock Supply Chains with Blockchain Traceability from Source to Ma2 chapters
- Generalization and network design strategies2 chapters
- Fish product mislabelling: failings of traceability in the production chain and 2 chapters
BibTeX
@article{Wu2020,
author = {Wu, Zonghan and Pan, Shirui and Chen, Fengwen and Long, Guodong and Zhang, Chengqi and Yu, Philip S},
journal = {IEEE transactions on neural networks and learning systems},
title = {A comprehensive survey on graph neural networks},
year = {2020},
number = {1},
pages = {4–24},
volume = {32},
publisher = {IEEE},
}