TY - GEN
T1 - Hypergraph disentangling and cross-level contrastive learning for recommendation
AU - Zhang, Yu
AU - Meng, Shunmei
AU - Zhou, Jielong
AU - Li, Qianmu
AU - Zhang, Xuyun
PY - 2026
Y1 - 2026
N2 - Hypergraphs have emerged as a critical technique to enhance recommendation performance by directly modeling global and higher-order associations in interaction graphs. However, existing hypergraph methods typically focus on high-order relations, neglecting the role of pairwise relations between nodes, and excessively entangle user and item features during convolution. Aiming to tackle the challenges, we introduce a new Hypergraph Disentangling and Cross-Level Contrastive Learning mechanism, named HDCCL. Specifically, we construct dual-perspective hypergraphs of users/items and disentangle them into three complementary views: clique graphs, star graphs, and dynamic weighted graphs, achieving dynamic multiscale feature fusion from both spatial and spectral perspectives. Additionally, a novel bidirectional attention-based feature decoupling mechanism is designed to differentiate domain-specific unique features from cross-domain commonalities, while explicitly integrating neighborhood aggregation signals from lower-order graphs to effectively enhance the feature entanglement issue. Furthermore, this paper introduces a cross-level contrastive learning module to constrain the semantic consistency of multi-views and enhance the robustness of representations. Comprehensive experiments on publicly accessible datasets demonstrate the superiority of our HDCCL.
AB - Hypergraphs have emerged as a critical technique to enhance recommendation performance by directly modeling global and higher-order associations in interaction graphs. However, existing hypergraph methods typically focus on high-order relations, neglecting the role of pairwise relations between nodes, and excessively entangle user and item features during convolution. Aiming to tackle the challenges, we introduce a new Hypergraph Disentangling and Cross-Level Contrastive Learning mechanism, named HDCCL. Specifically, we construct dual-perspective hypergraphs of users/items and disentangle them into three complementary views: clique graphs, star graphs, and dynamic weighted graphs, achieving dynamic multiscale feature fusion from both spatial and spectral perspectives. Additionally, a novel bidirectional attention-based feature decoupling mechanism is designed to differentiate domain-specific unique features from cross-domain commonalities, while explicitly integrating neighborhood aggregation signals from lower-order graphs to effectively enhance the feature entanglement issue. Furthermore, this paper introduces a cross-level contrastive learning module to constrain the semantic consistency of multi-views and enhance the robustness of representations. Comprehensive experiments on publicly accessible datasets demonstrate the superiority of our HDCCL.
KW - Recommender System
KW - Hypergraph Neural Network
KW - Contrastive Learning
UR - https://www.scopus.com/pages/publications/105020743400
U2 - 10.1007/978-981-95-3456-2_23
DO - 10.1007/978-981-95-3456-2_23
M3 - Conference proceeding contribution
AN - SCOPUS:105020743400
SN - 9789819534555
T3 - Lecture Notes in Computer Science
SP - 333
EP - 347
BT - Advanced Data Mining and Applications
A2 - Yoshikawa, Masatoshi
A2 - Meng, Xiaofeng
A2 - Cao, Yang
A2 - Xiao, Chuan
A2 - Chen, Weitong
A2 - Wang, Yanda
PB - Springer, Springer Nature
CY - Singapore
T2 - International Conference on Advanced Data Mining and Applications (21st : 2025)
Y2 - 22 October 2025 through 24 October 2025
ER -