The paper introduces SEMGNN, an end‑to‑end self‑explainable multi‑label graph neural network that simultaneously classifies nodes and identifies edges contributing to each predicted label. Unlike post‑hoc explainers, SEMGNN jointly learns a predictor and a sparse edge‑mask explainer, leveraging label‑label correlations to improve classification and generate distinct, coherent explanations for each label. Experiments on synthetic and real‑world networks in social, entertainment, and life‑science domains demonstrate competitive predictive performance and more faithful, compact label‑conditioned explanations.
By Yingqi Feng, Yufei Tang, Min Shi, Xingquan Zhu
arXiv:2601. 17469v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have shown remarkable capabilities in learning from graph-structured data with various applications such as social analysis and bioinformatics.
By Wei Ju, Wei Zhang, Siyu Yi, Zhengyang Mao, Yifan Wang, Jingyang Yuan, Zhiping Xiao, Ziyue Qiao, Ming Zhang
arXiv:2606. 07475v1 Announce Type: cross Abstract: Node classification in graph neural networks (GNNs) has been widely applied in various fields of graph analysis.
By Takuto Takahashi, Itsuki Nakayama, Takahiro Mitani, Ryosuke Kikuchi, Yuya Sasaki, Makoto Onizuka
arXiv:2606. 29773v1 Announce Type: new Abstract: Graphs are widely used to model relational systems, with applications in domains such as social networks, finance, and biomedicine.
By Haoxin Sun, Yiqing Lin, Yajun Huang, Chenhui Dong, Mingjun Li, Zhongzhi Zhang
arXiv:2606. 10249v1 Announce Type: new Abstract: We examine whether graph neural network (GNN) design rules generalize across benchmark families by studying aggregator selection (sum, mean, max) on 24 node-classification datasets spanning citation, heterophilic, LINKX Facebook-100, co-purchase, and co-authorship graphs.
By Neha Sharma, Ritesh Sharma
The paper reinterprets graph neural networks (GNNs) as retrieval-augmented models, where each layer uses an MLP on a node representation and a permutation‑invariant summary of retrieved graph context instead of traditional message passing. It introduces RTA, a lightweight MLP‑based framework that replaces structural message passing with label‑aware retrieval and propagation, and provides theoretical links to softmax‑attention message passing and robustness to mis‑retrieved outliers. Experiments on text‑attributed graph benchmarks demonstrate that RTA matches or surpasses strong GNN and graph LLM baselines while improving efficiency and robustness.
By Jintang Li, Yuhong Chen, Ruofan Wu, Binli Luo, Jiayi Ji, Hui Li, Rongrong Ji
arXiv:2607. 22287v1 Announce Type: new Abstract: Graph-based recommendations are widely adopted in real-world industrial applications.
By Alessandro Sbandi, Federico Siciliano, Fabrizio Silvestri
arXiv:2507. 14484v2 Announce Type: replace Abstract: In recent years, graph neural networks (GNN) have achieved unprecedented successes in node classification tasks.
By Yule Li, Yifeng Lu, Zhen Wang, Zhewei Wei, Yaliang Li, Bolin Ding
HeTGB is a new benchmark for heterophilic text‑attributed graphs, consisting of five real‑world datasets where nodes have rich textual descriptions. It allows systematic evaluation of graph neural networks, pre‑trained language models, and co‑training methods on node classification. The benchmark highlights the utility of text attributes, the challenges of heterophilic TAGs, and the limitations of current models.
By Shujie Li, Yuxia Wu, Yuan Fang, Chuan Shi
The paper introduces DeGLIF, a denoising method for graph data that leverages a leave‑one‑out influence function to make node‑level predictions robust to label noise. DeGLIF uses a small clean subset and a theoretically motivated relabelling function to identify and correct noisy nodes without requiring knowledge of the noise model or level. Two variants of DeGLIF are proposed, one of which is proven to increase risk for detected noisy points, and experiments demonstrate that DeGLIF outperforms baseline algorithms on several datasets.
By Pintu Kumar, Nandyala Hemachandra
arXiv:2609.37057v1 Announce Type: new
Abstract: Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeat...
By Dooho Lee, Jinmo Lee, Minho Jeong, Kijung Shin, Jaemin Yoo
Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise proposes PCC+GCN, a hybrid framework that refines labels using Particle Competition and Cooperation before training a GCN. PCC identifies suspicious nodes via particle domination dynamics and decides whether to keep, remove, or reassign their labels, optionally augmenting the graph with k‑nearest‑neighbor edges. Evaluated on ten NoisyGL datasets under various noise types, PCC+GCN achieved the highest average accuracy and rank, outperforming baseline GCN by 1.67 percentage points and proving computationally efficient, especially under instance‑dependent noise.
By Fabricio Breve