SCGNN: Semantic Consistency enhanced Graph Neural Network Guided by Granular-ball Computing
Genhao Tian, Taihua Xu, Shuyin Xia, Qinghua Zhang, Jie Yang, Jianjun Chen

TL;DR
SCGNN introduces a scalable graph neural network framework that uses granular-ball computing to efficiently capture semantic consistency, reducing computational costs and noise compared to traditional neighbor-based methods.
Contribution
The paper proposes a novel plug-and-play framework, SCGNN, that models group-level semantic structure with granular-ball computing and enhances supervision via anchor-based and label consistency modules.
Findings
SCGNN reduces computational complexity compared to $k$NN-based methods.
It improves robustness to noisy connections in graph learning.
Experimental results demonstrate enhanced performance across various GNN backbones.
Abstract
Capturing semantic consistency among nodes is crucial for effective graph representation learning. Existing approaches typically rely on -nearest neighbors (NN) or other node-level full search algorithms (FSA) to mine semantic relationships via exhaustive pairwise similarity computation, which suffer from high computational complexity and rigid neighbor selection, limiting scalability and introducing noisy connections. In this paper, we propose the Semantic Consistency enhanced Graph Neural Network (SCGNN), a novel plug-and-play framework that leverages granular-ball computing (GBC) to efficiently capture semantic consistency in a scalable manner. Unlike node-level FSA methods, SCGNN models group-level semantic structure by adaptively partitioning nodes into granular balls, significantly reducing computational cost while improving robustness to noise. To effectively utilize the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
