Sign inGet started
Paper · arXiv

Signed-Graph Recommendation as Structural Consistency Maximization

While signed social recommendation has shown great potential by modeling both trust and distrust relations, its effectiveness is often hindered by structural noise and data sparsity. In this work, we first identify a fundamental inconsistency across the structural, propagation, and semantic layers of existing models, which leads to biased representations learned from sparse or noisy datasets. Furthermore, we observe that most existing methods treat the observed graph as fixed, failing to bridge the gap between noisy topologies and reliable social semantics. To address these issues, we propose a unified framework named SSC-Loop that treats signed social recommendation as the maximization o...

AuthorsZifan Wang, Siyu Chen, Wenzhuo Song
Primary categorycs.SI
Published7 July 2026
Last updated at source7 July 2026
cs.SIcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/e25980bf-35ff-4f93-965d-00c76e3554c8" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.