Efficient and Effective Augmentation Framework With Latent Mixup and Label-Guided Contrastive Learning for Graph Classification

Graph Neural Networks (GNNs) with data augmentation obtain promising results among existing solutions for graph classification. Mixup-based augmentation methods for graph classification have already achieved state-of-the-art performance. However, existing mixup-based augmentation methods either operate in the input space and thus face the challenge of balancing efficiency and accuracy, or directly conduct mixup in the latent space without similarity guarantee, thus leading to lacking semantic validity and limited performance. To address these limitations, this paper proposes <inline-formula><tex-math notation="LaTeX">$\mathcal {G}$</tex-math></inline-formula>-MixCon, a novel framework leveraging the strengths of <i><u>Mix</u></i>up-based augmentation and supervised <i><u>Con</u></i>trastive learning (SCL). To the best of our knowledge, this is the first attempt to develop an SCL-based approach for learning graph representations. Specifically, the mixup-based strategy within the latent space named <inline-formula><tex-math notation="LaTeX">$GDA_{gl}$</tex-math></inline-formula> and <inline-formula><tex-math notation="LaTeX">$GDA_{nl}$</tex-math></inline-formula> are proposed, which efficiently conduct linear interpolation between views of the node or graph level. Furthermore, we design a dual-objective loss function named <i>SupMixCon</i> that can consider both the consistency among graphs and the distances between the original and augmented graph. <i>SupMixCon</i> can guide the training process for SCL in <inline-formula><tex-math notation="LaTeX">$\mathcal {G}$</tex-math></inline-formula>-MixCon while achieving a similarity guarantee. Comprehensive experiments are conducted on various real-world datasets, the results show that <inline-formula><tex-math notation="LaTeX">$\mathcal {G}$</tex-math></inline-formula>-MixCon demonstrably enhances performance, achieving an average accuracy increment of 6.24%, and significantly increases the robustness of GNNs against noisy labels.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Knowledge and Data Engineering
Published
2024-09-30
DOI
https://doi.org/10.1109/tkde.2024.3471659
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Effective Augmentation Framework With Latent Mixup and Label-Guided Contrastive Learning for Graph Classification

Xuemin Lin, Wenjie Zhang, Liping Wang, Aoting Zeng
IEEE Transactions on Knowledge and Data Engineering
Advanced Graph Neural Networks
article

Efficient and Effective Augmentation Framework With Latent Mixup and Label-Guided Contrastive Learning for Graph Classification

Xuemin Lin, Wenjie Zhang, Liping Wang, Aoting Zeng
article en

Abstract

Graph Neural Networks (GNNs) with data augmentation obtain promising results among existing solutions for graph classification. Mixup-based augmentation methods for graph classification have already achieved state-of-the-art performance. However, existing mixup-based augmentation methods either operate in the input space and thus face the challenge of balancing efficiency and accuracy, or directly conduct mixup in the latent space without similarity guarantee, thus leading to lacking semantic validity and limited performance. To address these limitations, this paper proposes <inline-formula><tex-math notation="LaTeX">$\mathcal {G}$</tex-math></inline-formula>-MixCon, a novel framework leveraging the strengths of <i><u>Mix</u></i>up-based augmentation and supervised <i><u>Con</u></i>trastive learning (SCL). To the best of our knowledge, this is the first attempt to develop an SCL-based approach for learning graph representations. Specifically, the mixup-based strategy within the latent space named <inline-formula><tex-math notation="LaTeX">$GDA_{gl}$</tex-math></inline-formula> and <inline-formula><tex-math notation="LaTeX">$GDA_{nl}$</tex-math></inline-formula> are proposed, which efficiently conduct linear interpolation between views of the node or graph level. Furthermore, we design a dual-objective loss function named <i>SupMixCon</i> that can consider both the consistency among graphs and the distances between the original and augmented graph. <i>SupMixCon</i> can guide the training process for SCL in <inline-formula><tex-math notation="LaTeX">$\mathcal {G}$</tex-math></inline-formula>-MixCon while achieving a similarity guarantee. Comprehensive experiments are conducted on various real-world datasets, the results show that <inline-formula><tex-math notation="LaTeX">$\mathcal {G}$</tex-math></inline-formula>-MixCon demonstrably enhances performance, achieving an average accuracy increment of 6.24%, and significantly increases the robustness of GNNs against noisy labels.

IEEE Transactions on Knowledge and Data EngineeringVol. 36(12)
Shanghai Jiao Tong University (CN), UNSW Sydney (AU), East China Normal University (CN)
Openalex Percentile: Top 85%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.