← 返回论文检索
The ACM Web Conference 2026Track 2: Graph Algorithms and Modeling for the Web

SGExplainer: Balanced Path-based Signed Graph Neural Network Explanation for Link Sign Prediction

Jie Gao, Jia Hu 0001, Geyong Min, Fei Hao 0001

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。DOI 10.1145/3774904.3792146 ↗

摘要

Signed Graph Neural Networks (SGNNs) have achieved outstanding performance in Link Sign Prediction (LSP), which involves predicting the existence and polarity of edges, by effectively modeling positive and negative interactions in signed graphs. However, their black-box nature raises transparency concerns, necessitating faithful explanations of model behavior to ensure trustworthiness and accountability. Existing eXplainable GNN (XGNN) methods, primarily designed for unsigned graphs, struggle to provide meaningful and human-understandable explanations for SGNN-based LSP, often generating disconnected subgraph explanations or neglecting the unique sign interactions. To address the gap, we propose SGExplainer, a novel method that leverages balanced paths, a concept rooted in signed graph theory, to provide clear and faithful explanations for LSP. SGExplainer employs a path-enforcing mask learning framework that ensures interpretable balanced path generation while maintaining explanation fidelity. Extensive experiments on real-world signed graphs demonstrate that SGExplainer consistently provides faithful and intuitive explanations for various SGNNs, outperforming state-of-the-art baselines in explanation quality, interpretability, and efficiency.