Jul 2026· International journal of Computer Networks & Communications· 0 citations· 16 references
TL;DR
ASRA-GNN addresses gaps in Signed Graph Neural Networks through three contributions: Sign-Aware Structural Role Attention grounded in four social network theories, a Locally Adaptive Theory Mixing gate replacing TrustSGCN's binary global threshold with a continuous per-node end-toend learned mixing function, and a Signed Contrastive Recommendation Loss providing the first ranking objective for signed user-user graphs.
Abstract
Existing Signed Graph Neural Networks optimize link sign prediction objectives fundamentally misaligned with friend recommendation, while discarding trust asymmetry, edge strength, and adaptive social theory application. We present ASRA-GNN, addressing these gaps through three contributions: Sign-Aware Structural Role Attention (SSRA) grounded in four social network theories; a Locally Adaptive Theory Mixing (LATM) gate replacing TrustSGCN's binary global threshold with a continuous per-node end-toend learned mixing function; and a Signed Contrastive Recommendation Loss providing the first ranking objective for signed user-user graphs using observed positive-negative pairs as natural contrastive anchors. Experiments on Bitcoin-OTC and Bitcoin-Alpha demonstrate an average of Recall@10 of 0.0599, NDCG@10 of 0.4280, and Precision@10 of 0.0840, outperforming all other baselines.
This work identifies a fundamental inconsistency across the structural, propagation, and semantic layers of existing models that leads to biased representations learned from sparse or noisy datasets, and proposes a unified framework named SSC-Loop that treats signed social recommendation as the maximization of structur...
A post-hoc explainability framework for LightGCN is proposed combining two complementary techniques: Propagation Path Analysis, which decomposes recommendation scores by propagation layer to attribute influence to specific training interactions, and Counterfactual Graph Editing, which identifies the most influential us...
P. Nallari, Jayakumar Kaliappan· ITEGAM- Journal of Engineeri...· 0 citations
Learning on signed graphs poses unique challenges due to the presence of both positive and negative links, which represent complex social dynamics such as trust and conflict. While existing signed graph neural networks (SGNNs) have achieved promising results, most rely on deep, multi-hop propagation architectures that...
Yubo Sun, Haoxin Sun, Zhongzhi Zhang· Proceedings of the 32nd ACM...· 0 citations
A social relationship adjustment loss function, which dynamically adjusts the weights of social connections, and the Hilbert-Schmidt independence criterion loss function, which reduces the dependence between pre- and post-adjusted user/item embeddings, thereby amplifying the effect of adjusted social relationships on t...
A Trust and Distrust Enhanced Recommendation (TDER) algorithm for signed social networks is proposed, which captures higher quality trust and distrust embeddings and improves recommendation performance in signed social networks.
Yong-Yin Han, Rui Wang, Renhui Wu et al.· International Journal of Mac...· 0 citations
This work presents a scalable end-to-end GNN ranking system for production social graphs, focusing on two design choices that are critical in this setting: multi-hash ID embeddings and temporal neighbor sampling.
Maksim Utushkin, A. Ovsiannikov, Alexander D'Yakonov· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.