Graph Transplant: Node Saliency-Guided Graph Mixup with Local Structure Preservation
Joonhyung Park, Hajin Shim, Eunho Yang
Abstract
Graph-structured datasets usually have irregular graph sizes and connectivities, rendering the use of recent data augmentation techniques, such as Mixup, difficult. To tackle this challenge, we present the first Mixup-like graph augmentation method at the graph-level called Graph Transplant, which mixes irregular graphs in data space. To be well defined on various scales of the graph, our method identifies the substructure as a mix unit that can preserve the local information. Since the mixup-based methods without special consideration of the context are prone to generate noisy samples, our method explicitly employs the node saliency information to select meaningful subgraphs and adaptively determine the labels. We extensively validate our method with diverse GNN architectures on multiple graph classification benchmark datasets from a wide range of graph domains of different sizes. Experimental results show the consistent superiority of our method over other basic data augmentation baselines. We also demonstrate that Graph Transplant enhances the performance in terms of robustness and model calibration.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 81e62a0d-5b27-49c2-a0a7-887ab3a98330Cited by top-tier papers18
- Graph Invariant Learning with Subgraph Co-mixup for Out-of-Distribution GeneralizationTianrui Jia, Haoyang Li, Cheng Yang, Tao Tao et al.AAAI 2024 · 38 citations
- Kernel Ridge Regression-Based Graph Dataset DistillationZhe Xu, Yuzhong Chen, Menghai Pan, Huiyuan Chen et al.KDD 2023 · 37 citations
- NodeMixup: Tackling Under-Reaching for Graph Neural NetworksWeigang Lu, Ziyu Guan, Wei Zhao, Yaming Yang et al.AAAI 2024 · 29 citations
- Graph Mixup with Soft AlignmentsHongyi Ling, Zhimeng Jiang, Meng Liu, Shuiwang Ji et al.ICML 2023 · 28 citations
- Fused Gromov-Wasserstein Graph Mixup for Graph-level ClassificationsXinyu Ma, Xu Chu, Yasha Wang, Yang Lin et al.NeurIPS 2023 · 25 citations
Builds on10
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- DropEdge: Towards Deep Graph Convolutional Networks on Node ClassificationYu Rong, Wenbing Huang, Tingyang Xu, Junzhou HuangICLR 2020 · 1,599 citations
- AugMix: A Simple Data Processing Method to Improve Robustness and UncertaintyDan Hendrycks, Norman Mu, Ekin Dogus Cubuk, Barret Zoph et al.ICLR 2020 · 1,572 citations
- Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological ViewDeli Chen, Yankai Lin, Wei Li, Peng Li et al.AAAI 2020 · 1,353 citations
- A Fair Comparison of Graph Neural Networks for Graph ClassificationFederico Errica, Marco Podda, Davide Bacciu, Alessio MicheliICLR 2020 · 508 citations
Related papers
- Mixup for Node and Graph ClassificationYiwei Wang, Wei Wang, Yuxuan Liang, Yujun Cai et al.WWW 2021 · 220 citations
- IntraMix: Intra-Class Mixup Generation for Accurate Labels and NeighborsShenghe Zheng, Hongzhi Wang, Xianglong LiuNeurIPS 2024 · 11 citations
- G-Mixup: Graph Data Augmentation for Graph ClassificationXiaotian Han, Zhimeng Jiang, Ninghao Liu, Xia HuICML 2022 · 251 citations
- AGMixup: Adaptive Graph Mixup for Semi-supervised Node ClassificationWeigang Lu, Ziyu Guan, Wei Zhao, Yaming Yang et al.AAAI 2025 · 6 citations
- Is Graph Mixup Beneficial? Investigating Interpolation And Empirical Performance of Graph Mixup MethodsSimon Forbat, Rainer GemullaICML 2026
