Sep 2026· Suranaree Journal of Science and Technology· 0 citations
TL;DR
The results demonstrate the value of combining graph transformers with hyperbolic space modeling and the gated fusion for next-item recommendation in sequential and social settings (the authors' code).
Abstract
Sequential behaviors and social ties jointly shape user preferences; however, most prior work models them in isolation and relies on shallow fusion in Euclidean space, which struggles to capture temporal drift and hierarchical social structure. We propose a novel framework; HGT4Rec, a Hyperbolic Graph Transformer for Sequential and Social Recommendation. A graph transformer encodes item-transition dependencies to track evolving preferences along the sequence, while a hyperbolic transformer operates on the social graph to represent long-range and hierarchical influence. We further introduce FusionGRU, an adaptive gating module that integrates the two representations into a unified preference state for Top-K prediction. Experiments on Yelp, iFashion, LastFM show that HGT4Rec delivers substantial improvements over the strongest baseline, achieving +348.22% / +314.86%, +383.21% / +210.19%, and +90.85% / +9.83% in Recall@10 and NDCG@10, respectively. Our results demonstrate the value of combining graph transformers with hyperbolic space modeling and the gated fusion for next-item recommendation in sequential and social settings (our code).
HGKAN (Hyperbolic Graph-Based Kolmogorov–Arnold Network), a unified framework that combines hyperbolic representation learning, graph neural networks, and KAN-based nonlinear fusion for social recommendation, is proposed.
Nikorn Kannikaklang, S. Wongthanavasu· IEEE Access· 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...
This work proposes SoDRA (Social Dynamic Refinement and Alignment), a framework that dynamically purifies social graphs via a closed-loop “guess → verify → update” mechanism, and employs multi-layer graph convolutional network propagation on both user-item and social graphs.
Yang Guo, Song-Song Hou, Xiang Li et al.· Journal of Supercomputing· 0 citations
Real-world relational data in recommender systems (RSs), particularly in domains such as e-commerce, often exhibits hierarchical structures, such as linking User → Product Category → Sub-Category → Item. Message-passing models such as Graph Neural Networks (GNNs), which propagate information across nodes, have been app...
Tendai Mukande, Noel E. O'Connor· Proceedings of the 20th ACM...· 0 citations
Hierarchical Interaction MOdeling for zero-shot generalist GAD enables anomaly detection across diverse graph domains without retraining or access to target-domain supervision by modeling the evolutionary trajectories of node representations across hierarchical structural depths, thereby capturing interaction patterns...
Xiang-Ping Zheng, Xuan Feng, Bo Wu et al.· Proceedings of the 32nd ACM...· 0 citations
Personalized social media commonly relies on explicit follow graphs to shape what content users encounter; yet how much attention crosses ties they have not formed remains largely undocumented at scale. We study this question on Bluesky, a large decentralized microblogging platform whose default feed relies on a simple...
Andrea Failla, Veronica Mesina, Giulio Rossetti· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.