Text-attributed graphs (TAGs) couple graph topology with node-level text, but real data often contain spurious edges, missing links, and text–structure mismatch that destabilize learning under scarce labels. We propose CoACL (Coupled Augmentation for Contrastive Learning), a framework that uses LLM semantic supervision to denoise structural and textual information and alleviate data sparsity. CoACL first prunes the candidate edge space using structural similarity and then queries an LLM to discard suspicious edges and confirm plausible links, yielding semantically consistent positive and negative pairs. We further introduce keyword-focused text augmentations and learn coupled representations by optimizing a joint text–graph contrastive objective guided by semantics. Experiment results on Cora, PubMed, and the Open Graph Benchmark Arxiv dataset (OGBN-Arxiv) show that CoACL consistently outperforms strong baselines and yields up to 7.1% absolute improvement in node classification accuracy, with the largest gains in low-label regimes. By constraining LLM evaluation to similarity-based candidates, CoACL targets neighborhood-level noise with controlled cost.
Building similarity graph...
Analyzing shared references across papers
Loading...
Hailun Kang
Kexin Zhao
Shuying Du
Electronics
Yanshan University
Virtual Technology (United States)
Building similarity graph...
Analyzing shared references across papers
Loading...
Kang et al. (Mon,) studied this question.
www.synapsesocial.com/papers/6996a7a5ecb39a600b3ed783 — DOI: https://doi.org/10.3390/electronics15040844