TY - GEN
T1 - Rethinking Adjacent Dependency in Session-Based Recommendations
AU - Zhang, Qian
AU - Wang, Shoujin
AU - Lu, Wenpeng
AU - Feng, Chong
AU - Peng, Xueping
AU - Wang, Qingxiang
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - Session-based recommendations (SBRs) recommend the next item for an anonymous user by modeling the dependencies between items in a session. Benefiting from the superiority of graph neural networks (GNN) in learning complex dependencies, GNN-based SBRs have become the main stream of SBRs in recent years. Most GNN-based SBRs are based on a strong assumption of adjacent dependency, which means any two adjacent items in a session are necessarily dependent here. However, based on our observation, the adjacency does not necessarily indicate dependency due to the uncertainty and complexity of user behaviours. Therefore, the aforementioned assumption does not always hold in the real-world cases and thus easily leads to two deficiencies: (1) the introduction of false dependencies between items which are adjacent in a session but are not really dependent, and (2) the missing of true dependencies between items which are not adjacent but are actually dependent. Such deficiencies significantly downgrade accurate dependency learning and thus reduce the recommendation performance. Aiming to address these deficiencies, we propose a novel review-refined inter-item graph neural network (RI-GNN), which utilizes the topic information extracted from items’ reviews to refine dependencies between items. Experiments on two public real-world datasets demonstrate that RI-GNN outperforms the state-of-the-art methods (The implementation is available at https://github.com/Nishikata97/RI-GNN. ).
AB - Session-based recommendations (SBRs) recommend the next item for an anonymous user by modeling the dependencies between items in a session. Benefiting from the superiority of graph neural networks (GNN) in learning complex dependencies, GNN-based SBRs have become the main stream of SBRs in recent years. Most GNN-based SBRs are based on a strong assumption of adjacent dependency, which means any two adjacent items in a session are necessarily dependent here. However, based on our observation, the adjacency does not necessarily indicate dependency due to the uncertainty and complexity of user behaviours. Therefore, the aforementioned assumption does not always hold in the real-world cases and thus easily leads to two deficiencies: (1) the introduction of false dependencies between items which are adjacent in a session but are not really dependent, and (2) the missing of true dependencies between items which are not adjacent but are actually dependent. Such deficiencies significantly downgrade accurate dependency learning and thus reduce the recommendation performance. Aiming to address these deficiencies, we propose a novel review-refined inter-item graph neural network (RI-GNN), which utilizes the topic information extracted from items’ reviews to refine dependencies between items. Experiments on two public real-world datasets demonstrate that RI-GNN outperforms the state-of-the-art methods (The implementation is available at https://github.com/Nishikata97/RI-GNN. ).
KW - Adjacent dependency
KW - Graph neural network
KW - Recommender system
KW - Session-based recommendation
UR - http://www.scopus.com/inward/record.url?scp=85130255483&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-05981-0_24
DO - 10.1007/978-3-031-05981-0_24
M3 - Conference contribution
AN - SCOPUS:85130255483
SN - 9783031059803
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 301
EP - 313
BT - Advances in Knowledge Discovery and Data Mining - 26th Pacific-Asia Conference, PAKDD 2022, Proceedings
A2 - Gama, João
A2 - Li, Tianrui
A2 - Yu, Yang
A2 - Chen, Enhong
A2 - Zheng, Yu
A2 - Teng, Fei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 26th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2022
Y2 - 16 May 2022 through 19 May 2022
ER -