SOTAVerified

Semi-Supervised Classification with Graph Convolutional Networks

2016-09-09Code Available1· sign in to hype

Thomas N. Kipf, Max Welling

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions. Our model scales linearly in the number of graph edges and learns hidden layer representations that encode both local graph structure and features of nodes. In a number of experiments on citation networks and on a knowledge graph dataset we demonstrate that our approach outperforms related methods by a significant margin.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
ogbg-code2GCNNumber of params11,033,210Unverified
ogbg-code2GCN+virtual nodeNumber of params12,484,310Unverified
ogbg-molhivGCNNumber of params527,701Unverified
ogbg-molhivGCN (in Julia)Number of params527,701Unverified
ogbg-molhivGCN+virtual nodeNumber of params1,978,801Unverified
ogbg-molpcbaGCNNumber of params565,928Unverified
ogbg-molpcbaGCN+virtual nodeNumber of params2,017,028Unverified
ogbg-ppaGCNNumber of params479,437Unverified
ogbg-ppaGCN+virtual nodeNumber of params1,930,537Unverified

Reproductions