SOTAVerified

Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules

2018-11-23Code Available0· sign in to hype

Boris Knyazev, Xiao Lin, Mohamed R. Amer, Graham W. Taylor

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Spectral Graph Convolutional Networks (GCNs) are a generalization of convolutional networks to learning on graph-structured data. Applications of spectral GCNs have been successful, but limited to a few problems where the graph is fixed, such as shape correspondence and node classification. In this work, we address this limitation by revisiting a particular family of spectral graph networks, Chebyshev GCNs, showing its efficacy in solving graph classification tasks with a variable graph structure and size. Chebyshev GCNs restrict graphs to have at most one edge between any pair of nodes. To this end, we propose a novel multigraph network that learns from multi-relational graphs. We model learned edges with abstract meaning and experiment with different ways to fuse the representations extracted from annotated and learned edges, achieving competitive results on a variety of chemical classification benchmarks.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
ENZYMESMultigraph ChebNetAccuracy61.7Unverified
MUTAGMultigraph ChebNetAccuracy89.1Unverified
NCI1Multigraph ChebNetAccuracy83.4Unverified
NCI109Multigraph ChebNetAccuracy82Unverified
PROTEINSMultigraph ChebNetAccuracy76.5Unverified

Reproductions