Motif-based Graph Representation Learning with Application to Chemical Molecules
Abstract
This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real applications. Existing graph neural networks offer limited ability to capture complex interactions within local structural contexts, which hinders them from taking advantage of the expression power of ARGs. We propose Motif Convolution Module (MCM), a new motif-based graph representation learning technique to better utilize local structural information. The ability to handle continuous edge and node features is one of MCM's advantages over existing motif-based models. MCM builds a motif vocabulary in an unsupervised way and deploys a novel motif convolution operation to extract the local structural context of individual nodes, which is then used to learn higher-level node representations via multilayer perceptron and/or message passing in graph neural networks. When compared with other graph learning approaches to classifying synthetic graphs, our approach is substantially better in capturing structural context. We also demonstrate the performance and explainability advantages of our approach by applying it to several molecular benchmarks. The code is available at.
Benchmark Results
Tested on 7 datasets 7 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
OGB
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | Multi-RF Fusion with Multi-GNN Blending | 0.8476
±0.0002 | |
| 2 | HyperFusion | 0.8475
±0.0003 | |
| 3 | PAS+FPs | 0.8420
±0.0015 | |
| 9 | GatedGCN | 0.8090
±0.0160 | |
| 109 | GIN | 0.7780
±0.0182 best reported | best at pub: GRPE: Relative Positional Encoding for Graph Transformer (2022) Difference within reported uncertainty; not counted as underperformance. |
| 157 | MCM + GIN | 0.7700
±0.0120 | This paper |
| 160 | GraphSAGE | 0.7690
±0.0136 | |
| 184 | GCN | 0.7630
±0.0030 | prev best: Do We Need Anisotropic Graph Neural Networks? (ICLR 2021) Improvement within reported uncertainty; not highlighted. |
| 215 | MCM + GCN | 0.7570
±0.0060 | This paper |
| # | Model | AP ↑ | Paper |
|---|---|---|---|
| 1 | GRPE-Large | 0.3150
±0.0010 | |
| 2 | Graphormer | 0.3140 | |
| 3 | Graphormer-FLAG | 0.3139
±0.0032 | |
| 31 | GIN | 0.2902
±0.0017 best reported | best at pub: GRPE: Relative Positional Encoding for Graph Transformer (2022) |
| 56 | GCN | 0.2690
±0.0020 best reported | |
| 89 | MCM + GIN | 0.2278
±0.0014 | This paper |
| 98 | MCM + GCN | 0.2048
±0.0018 | This paper |
MoleculeNet
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | HIMP | 0.8740
±0.0050 | |
| 2 | GINE w/ VN | 0.8720
±0.0030 | |
| 3 | NaiveGINe+ K=3 w/ VN | 0.8700
±0.0040 | |
| 14 | GCN | 0.8400
±0.0040 best reported | best at pub: Graph convolutions that can finally model local structure (2020) |
| 24 | GIN | 0.8290
±0.0069 best reported | |
| 51 | MCM + GIN | 0.8020
±0.0150 | This paper |
| 78 | MCM + GCN | 0.7940
±0.0150 | This paper |
| 135 | GraphSAGE | 0.7744
±0.0038 | |
| 138 | MICRO-Graph | 0.7740
±0.0060 | This paper |
| 171 | MGSSL (BFS) | 0.7650
±0.0030 | This paper |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | ProtoMol | 0.9140
±0.0030 | |
| 2 | MMSG | 0.9080
±0.0050 | |
| 3 | MemGNN | 0.9070 | |
| 43 | GIN | 0.8646
±0.0081 best reported | best at pub: Optimal Transport Graph Neural Networks (2020) best today: Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck (AAAI 2024) Difference within reported uncertainty; not counted as underperformance. |
| 64 | GCN | 0.8110
±0.0300 | prev best: OOD-GNN: Out-of-Distribution Generalized Graph Neural Network (2021) Improvement within reported uncertainty; not highlighted. |
| 82 | GraphSAGE | 0.8451 | |
| 131 | MCM + GIN | 0.8200
±0.0550 | This paper |
| 134 | MICRO-Graph | 0.8190
±0.0040 | This paper |
| 168 | MCM + GCN | 0.8060
±0.0260 | This paper |
| 184 | MGSSL (DFS) | 0.7970
±0.0080 | This paper |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | MAGPrompt+ | 0.9432
±0.0238 | |
| 2 | CamS-LLaMA | 0.9420 | |
| 3 | SE(3)-I MPPH | 0.9400
±0.0210 | |
| 22 | MCM + GCN | 0.9170
±0.0310 | This paper |
| 33 | MCM + GIN | 0.9000
±0.0310 | This paper |
| 34 | GIN | 0.8730
±0.0360 | prev best: OOD-GNN: Out-of-Distribution Generalized Graph Neural Network (2021) |
| 38 | GCN | 0.8810
±0.0360 | |
| 46 | MICRO-Graph | 0.8700
±0.0080 | This paper |
| 57 | GraphSAGE | 0.8304
±0.0038 | |
| 131 | MGSSL (DFS) | 0.7050
±0.0110 | This paper |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | SE(3)-I MPPH | 0.9930
±0.0040 | |
| 2 | KA-GCN | 0.9920
±0.0050 | |
| 3 | KA-GAT | 0.9910
±0.0050 | |
| 19 | GCN | 0.9130
±0.0170 best reported | best at pub: OOD-GNN: Out-of-Distribution Generalized Graph Neural Network (2021) |
| 36 | GIN | 0.8810
±0.0250 best reported | best at pub: OOD-GNN: Out-of-Distribution Generalized Graph Neural Network (2021) |
| 84 | MGSSL (BFS) | 0.8070
±0.0210 | This paper |
| 108 | MICRO-Graph | 0.7756
±0.0156 best reported | |
| 200 | MCM + GIN | 0.6550
±0.1390 | This paper |
| 218 | MCM + GCN | 0.6120
±0.1450 | This paper |
| 238 | GraphSAGE | 0.5580
±0.0620 |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | KA-GAT | 0.8470
±0.0020 | |
| 2 | KA-GCN | 0.8420
±0.0010 | |
| 3 | GraphKAN | 0.8370
±0.0010 | |
| 66 | GIN | 0.6160
±0.0250 | prev best: OOD-GNN: Out-of-Distribution Generalized Graph Neural Network (2021) |
| 92 | MCM + GIN | 0.6270
±0.0280 | This paper |
| 99 | MCM + GCN | 0.6240
±0.0240 | This paper |
| 115 | MGSSL (BFS) | 0.6180
±0.0080 | This paper |
| 117 | MICRO-Graph | 0.6170
±0.0180 | |
| 125 | GCN | 0.6150
±0.0250 | prev best: OOD-GNN: Out-of-Distribution Generalized Graph Neural Network (2021) Improvement within reported uncertainty; not highlighted. |
| 227 | GraphSAGE | 0.5670
±0.0010 |
