arXiv Analytics

Sign in

arXiv:1812.08434 [cs.LG]AbstractReferencesReviewsResources

Graph Neural Networks: A Review of Methods and Applications

Jie Zhou, Ganqu Cui, Zhengyan Zhang, Cheng Yang, Zhiyuan Liu, Maosong Sun

Published 2018-12-20Version 1

Lots of learning tasks require dealing with graph data which contains rich relation information among elements. Modeling physics system, learning molecular fingerprints, predicting protein interface, and classifying diseases require that a model to learn from graph inputs. In other domains such as learning from non-structural data like texts and images, reasoning on extracted structures, like the dependency tree of sentences and the scene graph of images, is an important research topic which also needs graph reasoning models. Graph neural networks (GNNs) are connectionist models that capture the dependence of graphs via message passing between the nodes of graphs. Unlike standard neural networks, graph neural networks retain a state that can represent information from its neighborhood with an arbitrary depth. Although the primitive graph neural networks have been found difficult to train for a fixed point, recent advances in network architectures, optimization techniques, and parallel computation have enabled successful learning with them. In recent years, systems based on graph convolutional network (GCN) and gated graph neural network (GGNN) have demonstrated ground-breaking performance on many tasks mentioned above. In this survey, we provide a detailed review over existing graph neural network models, systematically categorize the applications, and propose four open problems for future research.

Related articles: Most relevant | Search more
arXiv:1710.03163 [cs.LG] (Published 2017-10-09)
Random Projection and Its Applications
arXiv:1201.5338 [cs.LG] (Published 2012-01-25, updated 2012-09-21)
On Constrained Spectral Clustering and Its Applications
arXiv:1905.00331 [cs.LG] (Published 2019-05-01)
High-Performance Support Vector Machines and Its Applications