A DHISL network that first captures individual spatiotemporal characteristics through feature-guided representation initialization, and then adopts a dual-branch framework that introduces dual constraints in a multi-channel disentangled space to achieve intra-channel consistency and inter-channel exclusivity.
A novel Dual-Channel Hybrid Graph Neural Network (HyGNN) that jointly models temporal dynamics and high-order structural dependencies and robustly captures the nonlinear interplay between mobility and sociality.
Liang Chen, Xiang Li, Guiyuan Jiang et al.· 0 citations
This work proposes a self-expressive solver that captures the complementary homophily between meta-paths and node features to obtain ho-mophilous representations and designs separate path encoders to model diverse interactions, thus explicitly including cross-type interactions while mitigating noise via adaptive fusion.
Minda Chen, Yujie Mo, Jun-Kai Huang et al.· 0 citations
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).
Unknown authors· Suranaree Journal of Science...· 0 citations
Trajectory-User Linking (TUL) aims to identify the owner of an anonymous trajectory from a set of candidate users, providing a basis for user mobility analysis and personalized location-aware services. Existing methods often learn Point of Interest (POI), temporal, and semantic features independently, make limited use of structural knowledge shared across trajectories, and compress structural and sequential information before classification. To address these issues, we propose Multi-Relational Knowledge Graph Enhanced Embedding for Trajectory-User Linking (MakeTUL), which, to the best of our knowledge, is the first attempt to introduce knowledge graph representation learning into TUL. MakeTUL organizes visit-time, POI-category, and transfer-speed information as typed relations in a multi-relational mobility knowledge graph, allowing heterogeneous mobility semantics to jointly constrain the learned embeddings. The resulting POI representations are further enriched with high-order co-occurrence patterns extracted from the trajectory collection, providing structural prior knowledge for sparse and overlapping trajectories. By integrating these prior-enhanced representations with temporal, category, and transfer information, the trajectory sequence learning module captures ordered mobility patterns, while a dual-branch classification layer preserves and combines global structural evidence and sequential evidence at the decision level.
Orthogonal Decomposition for Social Recommendation (ODSR) is proposed, an embedding-space framework that orthogonally decomposes the aggregated social message into an aligned component and an orthogonal deviation, and learns a dimension-wise vector gate to regulate the deviation under ranking supervision.
Rongfeng Guo, Yinxuan Huang, Wei Chen et al.· Proceedings of the 32nd ACM...· 0 citations
This framework introduces a dual-encoder architecture that separately processes structural and attribute information, incorporates node positional encoding to approximate Neighborhood Identity Distribution (NID), and employs dual reconstruction tasks for both edges and node attributes.
