Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules
Boris Knyazev, Xiao Lin, Mohamed R. Amer, Graham W. Taylor
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/bknyaz/graph_nnpytorch★ 0
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
| Dataset | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| ENZYMES | Multigraph ChebNet | Accuracy | 61.7 | — | Unverified |
| MUTAG | Multigraph ChebNet | Accuracy | 89.1 | — | Unverified |
| NCI1 | Multigraph ChebNet | Accuracy | 83.4 | — | Unverified |
| NCI109 | Multigraph ChebNet | Accuracy | 82 | — | Unverified |
| PROTEINS | Multigraph ChebNet | Accuracy | 76.5 | — | Unverified |