Hyperbolic Hypergraphs for Sequential Recommendation

被引:43
作者
Li, Yicong [1 ]
Chent, Hongxu [1 ]
Sun, Xiangguo [2 ]
Sun, Zhenchao [3 ]
Li, Lin [4 ]
Cui, Lizhen [3 ]
Yu, Philip S. [5 ]
Xut, Guandong [1 ]
机构
[1] Univ Technol Sydney, Sydney, NSW, Australia
[2] Southeast Univ, Nanjing, Peoples R China
[3] Shandong Univ, Jinan, Shandong, Peoples R China
[4] Wuhan Univ Technol, Wuhan, Peoples R China
[5] Univ Illinois, Chicago, IL USA
来源
PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021 | 2021年
基金
澳大利亚研究理事会;
关键词
Sequential Recommendation; Hypergraph; Hyperbolic Space; Self-supervised Learning; MODEL;
D O I
10.1145/3459637.3482351
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hypergraphs have been becoming a popular choice to model complex, non-pairwise, and higher-order interactions for recommender systems. However, compared with traditional graph-based methods, the constructed hypergraphs are usually much sparser, which leads to a dilemma when balancing the benefits of hypergraphs and the modelling difficulty. Moreover, existing sequential hypergraph recommendation overlooks the temporal modelling among user relationships, which neglects rich social signals from the recommendation data. To tackle the above shortcomings of the existing hypergraph-based sequential recommendations, we propose a novel architecture named Hyperbolic Hypergraph representation learning method for Sequential Recommendation (H(2)SeqRec) with the pre-training phase. Specifically, we design three self-supervised tasks to obtain the pre-training item embeddings to feed or fuse into the following recommendation architecture (with two ways to use the pre-trained embeddings). In the recommendation phase, we learn multi-scale item embeddings via a hierarchical structure to capture multiple time-span information. To alleviate the negative impact of sparse hypergraphs, we utilize a hyperbolic space-based hypergraph convolutional neural network to learn the dynamic item embeddings. Also, we design an item enhancement module to capture dynamic social information at each timestamp to improve effectiveness. Extensive experiments are conducted on two real-world datasets to prove the effectiveness and high performance of the model.
引用
收藏
页码:988 / 997
页数:10
相关论文
共 48 条
[1]  
[Anonymous], KDD19 P 25 ACM
[2]  
Chami I, 2019, ADV NEUR IN, V32
[3]   Temporal Meta-path Guided Explainable Recommendation [J].
Chen, Hongxu ;
Li, Yicong ;
Sun, Xiangguo ;
Xu, Guandong ;
Yin, Hongzhi .
WSDM '21: PROCEEDINGS OF THE 14TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2021, :1056-1064
[4]  
Ganea OE, 2018, ADV NEUR IN, V31
[5]  
Gharahighehi Alireza, 2020, ARXIV201200387
[6]  
Hidasi B., P ICLR C SAN JUAN, P1
[7]   Recurrent Neural Networks with Top-k Gains for Session-based Recommendations [J].
Hidasi, Balazs ;
Karatzoglou, Alexandros .
CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, :843-852
[8]  
Huang Bo, 2020, ARXIV200802546
[9]   An Efficient Group Recommendation Model With Multiattention-Based Neural Networks [J].
Huang, Zhenhua ;
Xu, Xin ;
Zhu, Honghao ;
Zhou, MengChu .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2020, 31 (11) :4461-4474
[10]  
Hwang Dasol, 2020, ARXIV200708294