SOTAVerified

Learning Convolutional Neural Networks for Graphs

2016-05-17Code Available0· sign in to hype

Mathias Niepert, Mohamed Ahmed, Konstantin Kutzkov

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that operate on locally connected regions of the input, we present a general approach to extracting locally connected regions from graphs. Using established benchmark data sets, we demonstrate that the learned feature representations are competitive with state of the art graph kernels and that their computation is highly efficient.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
COX2PSCNAccuracy(10-fold)75.21Unverified
D&DPSCNAccuracy76.27Unverified
IMDb-BPSCNAccuracy71Unverified
MUTAGPATCHY-SANAccuracy92.63Unverified
MUTAGPSCNAccuracy88.95Unverified
NCI1PSCNAccuracy76.34Unverified
PTCPATCHY-SANAccuracy60Unverified

Reproductions