Skip to content
Conference Open access

Disentangled Hypergraph Network with Implicit Structure Learning for Mobility Social Relationship Inference

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · 0 citations · 43 references

TL;DR

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.

Abstract

Inferring social relationships from users' mobile data holds significant value for personalized recommendations. Most methods model user interactions based on co-occurrence records, achieving impressive success in capturing social signals. However, despite these advancements, current techniques still face three primary challenges. First, compressing higher-order co-occurrences into a single representation space easily leads to semantic entanglement. Second, relying on deterministic topology overlooks unobserved homophily. Third, the intrinsic characteristics of the users themselves are frequently ignored. To address these challenges, we propose a Disentangled Hypergraph Network with Implicit Structure Learning for mobility social relationship inference, named DHISL. Specifically, it first captures individual spatiotemporal characteristics through feature-guided representation initialization, and then adopts a dual-branch framework: the explicit branch models social and spatiotemporal preference signals, while the implicit branch adaptively learns a sparse channel-wise relational structure via differentiable structure learning. Furthermore, we introduce dual constraints in a multi-channel disentangled space to achieve intra-channel consistency and inter-channel exclusivity. Experiments on four real-world datasets demonstrate that DHISL outperforms state-of-the-art models, achieving average improvements of 6.34% in ROCAUC and 6.39% in PRAUC. The source code is available at https://github.com/Tilamisu-zz/DHISL.

Read PDF

Similar papers

Conference Open access Sep 2026

Dual-Channel Hybrid Graph Neural Network for Mobility Social Relationship Inference

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, Gui-Yuan Jiang et al. · 0 citations
Conference Open access Sep 2026

Bridging Feature-structural Homophily and Long-range Heterogeneity for Self-supervised Heterogeneous Graph Learning

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

Min-Da Chen, Yujie Mo, Jun-Kai Huang et al. · 0 citations
Open access Sep 2026

HGT4REC: HYPERBOLIC GRAPH TRANSFORMER FOR SEQUENTIAL AND SOCIAL RECOMMENDATION

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

Rungthip Cobal, Jintana Polsri, Phatthira Keawkerd et al. · 0 citations
Preprint Aug 2026

Multi-Relational Knowledge Graph Enhanced Embedding for Trajectory-User Linking

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.

Zhifeng Chu, Bin Wang · 0 citations
Book Open access Aug 2026

Embedding-Space Orthogonal Decomposition for Robust Social Recommendation

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

Unsupervised Graph Representation Learning with Complementary View Alignment

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.

Zengyi Wo, Shiyu Zhang, Qiyao Peng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.