GraphCrop: Subgraph Cropping for Graph Classification
Abstract
We present a new method to regularize graph neural networks (GNNs) for better generalization in graph classification. Observing that the omission of sub-structures does not necessarily change the class label of the whole graph, we develop the GraphCrop (Subgraph Cropping) data augmentation method to simulate the real-world noise of sub-structure omission. In principle, GraphCrop utilizes a node-centric strategy to crop a contiguous subgraph from the original graph while maintaining its connectivity. By preserving the valid structure contexts for graph classification, we encourage GNNs to understand the content of graph structures in a global sense, rather than rely on a few key nodes or edges, which may not always be present. GraphCrop is parameter learning free and easy to implement within existing GNN-based graph classifiers. Qualitatively, GraphCrop expands the existing training set by generating novel and informative augmented graphs, which retain the original graph labels in most cases. Quantitatively, GraphCrop yields significant and consistent gains on multiple standard datasets, and thus enhances the popular GNNs to outperform the baseline methods.
Benchmark Results
Tested on 5 datasets 8 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 best reported | best at pub: Provably Powerful Graph Networks (NeurIPS 2019) best today: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 3 | GCN | 0.9727 best reported | best at pub: Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels (NeurIPS 2019) best today: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 5 | DiffPool | 0.9210
±0.0260 best reported | best at pub: Contrastive Self-supervised Learning for Graph Classification (AAAI 2020) best today: Where to Mask: Structure-Guided Masking for Graph Masked Autoencoders (IJCAI 2024) |
| 12 | WL | 0.8590
±0.0010 best reported | best at pub: Propagation Kernels (2014) |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 244 | GraphCrop + EigenPool | 0.7960
±0.0200 | This paper |
| 278 | EigenPool | 0.7870
±0.0190 | prev best: Contrastive Self-supervised Learning for Graph Classification (AAAI 2020) Improvement within reported uncertainty; not highlighted. |
| 347 | GraphCrop + GCN | 0.7730
±0.0210 | This paper |
| 373 | DGCNN | 0.7650
±0.0190 | prev best: Deep Learning on Attributed Graphs: A Journey from Graphs to Their Embeddings and Back (2018) Improvement within reported uncertainty; not highlighted. |
| 533 | Graphlet | 0.6430
±0.0220 | prev best: Contrastive Self-supervised Learning for Graph Classification (AAAI 2020) Improvement within reported uncertainty; not highlighted. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9410
±0.0330 | |
| 2 | GRDL | 0.8260
±0.0120 | |
| 3 | GMN | 0.8225 | |
| 7 | DiffPool | 0.8161
±0.0232 best reported | best at pub: Memory-Based Graph Networks (ICLR 2020) |
| 32 | GIN | 0.7350
±0.0380 | prev best: Graph Neural Networks With Convolutional ARMA Filters (2019) Improvement within reported uncertainty; not highlighted. |
| 67 | SAGE | 0.7726
±0.0228 | |
| 132 | DGCNN | 0.7626 best reported | best at pub: Graph Convolutional Neural Networks with Node Transition Probability-based Message Passing and DropNode Regularization (2020) best today: Orthogonal Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 148 | GCN | 0.7600
±0.0320 best reported | best at pub: Graph Convolutional Networks with EigenPooling (KDD 2019) best today: Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors (2025) Difference within reported uncertainty; not counted as underperformance. |
| 149 | MLP | 0.7600
±0.0320 | |
| 190 | WL | 0.7560
±0.0040 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) Difference within reported uncertainty; not counted as underperformance. |
| 230 | EigenPool | 0.7519
±0.0195 best reported | best today: Multi-grained Semantics-aware Graph Neural Networks (2020) Difference within reported uncertainty; not counted as underperformance. |
| 263 | GraphCrop + EigenPool | 0.7490
±0.0330 | This paper |
| 316 | GraphCrop + GCN | 0.7400
±0.0350 | This paper |
| 370 | Graphlet | 0.7291 best reported | best at pub: Memory-Based Graph Networks (ICLR 2020) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9792 | |
| 2 | MSH-GNN | 0.9640
±0.0070 | |
| 3 | CoCN | 0.8722
±0.0013 | |
| 23 | GCN | 0.8260
±0.0220 best reported | best at pub: Fast Graph Representation Learning with PyTorch Geometric (ICLR 2019) best today: Scalable Expressiveness through Preprocessed Graph Perturbations (2024) |
| 30 | GIN | 0.8220
±0.0210 best reported | best at pub: On the Equivalence between Graph Isomorphism Testing and Function Approximation with GNNs (NeurIPS 2019) best today: Scalable Expressiveness through Preprocessed Graph Perturbations (2024) |
| 33 | DiffPool | 0.8213
±0.0043 best reported | best at pub: Fast Graph Representation Learning with PyTorch Geometric (ICLR 2019) best today: Scalable Graph Compressed Convolutions (2024) |
| 136 | GraphSAGE | 0.7970
±0.0170 | |
| 151 | MLP | 0.7920
±0.0240 | |
| 153 | WL | 0.7910
±0.0010 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) |
| 191 | DGCNN | 0.7759
±0.0224 best reported | best at pub: Graph U-Nets (2019) best today: Explainable Graph Representation Learning via Graph Pattern Analysis (IJCAI 2025) |
| 252 | GraphCrop + GCN | 0.7510
±0.0220 | This paper |
| 287 | GraphCrop + EigenPool | 0.7170
±0.0210 | This paper |
| 294 | EigenPool | 0.7080
±0.0190 | This paper |
| 322 | Graphlet | 0.6466 best reported | best at pub: Memory-Based Graph Networks (ICLR 2020) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GMN | 0.7866 | |
| 2 | MemGNN | 0.7550 | |
| 3 | TFGW SP | 0.7510
±0.0500 | |
| 17 | GatedGCN | 0.7000
±0.0494 | |
| 18 | WL | 0.6950
±0.0320 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Template based Graph Neural Network with Optimal Transport Distances (NeurIPS 2022) |
| 26 | GraphSAGE | 0.6817
±0.0545 | |
| 32 | GIN | 0.6030
±0.0420 | prev best: Graph Neural Networks With Convolutional ARMA Filters (2019) best today: GNNBenchmark (JMLR 2023) |
| 36 | GCN | 0.5910
±0.0470 | prev best: Graph Neural Networks With Convolutional ARMA Filters (2019) Improvement within reported uncertainty; not highlighted. |
| 49 | EigenPool | 0.6500 best reported | best at pub: MathNet: Haar-Like Wavelet Multiresolution-Analysis for Graph Representation and Learning (2020) Difference within reported uncertainty; not counted as underperformance. |
| 63 | GraphCrop + EigenPool | 0.6360
±0.0360 | This paper |
| 70 | DiffPool | 0.6253 best reported | best at pub: MathNet: Haar-Like Wavelet Multiresolution-Analysis for Graph Representation and Learning (2020) Difference within reported uncertainty; not counted as underperformance. |
| 95 | GraphCrop + GCN | 0.6010
±0.0420 | This paper |
| 119 | DGCNN | 0.5712 best reported | |
| 124 | MLP | 0.5583
±0.0352 | |
| 128 | Graphlet | 0.4140
±0.0520 | prev best: Memory-Based Graph Networks (ICLR 2020) best today: Contrastive Graph Few-Shot Learning (2022) Improvement within reported uncertainty; not highlighted. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GC-GNN (GCN) | 0.9210
±0.0810 | |
| 2 | SUGAR | 0.8403
±0.0133 | |
| 3 | Ortho-g-U-Nets | 0.8387 | |
| 15 | SAGE | 0.8088
±0.0233 | |
| 18 | DiffPool | 0.8064 best reported | best at pub: Graph U-Nets (2019) best today: Orthogonal Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 25 | WL | 0.7978
±0.0036 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Graph Learning with Distributional Edge Layouts (2024) |
| 37 | DGCNN | 0.7937 best reported | best at pub: Deep Learning on Attributed Graphs: A Journey from Graphs to Their Embeddings and Back (2018) best today: Orthogonal Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 43 | GCN | 0.7912
±0.0307 best reported | best at pub: Graph Convolutional Networks with EigenPooling (KDD 2019) best today: Hierarchical Graph Capsule Network (AAAI 2020) Difference within reported uncertainty; not counted as underperformance. |
| 57 | EigenPool | 0.7863
±0.0136 best reported | best at pub: Contrastive Self-supervised Learning for Graph Classification (AAAI 2020) Difference within reported uncertainty; not counted as underperformance. |
| 62 | Graphlet | 0.7845 best reported | |
| 74 | GIN | 0.7540
±0.0260 | prev best: Graph Neural Networks With Convolutional ARMA Filters (2019) Improvement within reported uncertainty; not highlighted. |
| 100 | GraphCrop + EigenPool | 0.7730
±0.0320 | This paper |
| 133 | GraphCrop + GCN | 0.7530
±0.0300 | This paper |
