Skip to content
Open access

HGT4REC: HYPERBOLIC GRAPH TRANSFORMER FOR SEQUENTIAL AND SOCIAL RECOMMENDATION

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).

Read PDF

Similar papers

Open access 2026

HGKAN: Hyperbolic Graph-Based Kolmogorov–Arnold Network for Social Recommendation

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 · 0 citations
Aug 2026

Graph-based social recommendation with redundant information suppression

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...

Shu-Run Zuo, Heng-Ru Zhang, Yuan-Yuan Xu · 0 citations
Book Open access Sep 2026

Towards Efficient Hyperbolic Representation Learning for Recommender Systems

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 · 0 citations
Book Open access Aug 2026

Rethinking Generalization in Graphs: A Hierarchical Interaction Perspective for Generalist Detection

With the increasing heterogeneity of social networks and online interaction systems, generalist graph anomaly detection (GAD) has become essential for identifying abnormal and fraudulent behaviors in complex environments. However, most existing GAD approaches rely heavily on domain-specific semantic alignment, which su...

Xiang-Ping Zheng, Xuan Feng, Bo Wu et al. · 0 citations
Preprint Oct 2026

Out-of-Network Attention Dynamics on Bluesky

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.