Cross-view temporal graph contrastive learning for session-based recommendation

被引:14
作者
Wang, Haosen [1 ]
Yan, Surong [1 ]
Wu, Chunqi [1 ]
Han, Long [2 ]
Zhou, Linghong [3 ]
机构
[1] Zhejiang Univ Finance & Econ, Hangzhou, Peoples R China
[2] Xi An Jiao Tong Univ, Xian, Peoples R China
[3] Zhejiang Tongji Vocat Coll Sci & Technol, Hangzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Session -based recommendation; Graph neural network; Contrastive learning; Temporal graph;
D O I
10.1016/j.knosys.2023.110304
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Session-based recommendation (SBR) aims at recommending items given the behavior sequences of anonymous users in a short-term session. Many recent SBR methods construct all sessions as a global graph that captures cross-session item transition patterns (i.e., users' global preference) to alleviate the problem of session data sparsity. However, these methods neglect that users' interests will drift as the time between the sessions constantly increases, limiting the performance improvement of SBR. To fill this gap, we divide all sessions into a group of time-slices and model the cross-session item transitions for every time-slice. We further construct two augmentation views (i.e., temporal graph and temporal hypergraph views) to model pairwise and high-order item transitions on SBR. In addition, we construct contrastive learning between two views to improve the recommendation performance by maximizing the mutual information between the item representations learned from the two views. Experiments on three public real-world datasets (i.e., Diginetica, Retailrocket, and Yoochoose) show that our model is consistently superior to the other state-of-the-art baselines, especially in time-sensitive datasets. For instance, our model achieves 14.42% and 11.72% improvements in terms of P@10 and P@20 on the Diginetica dataset, respectively. (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 58 条
  • [1] Bachman P., 2019, P 30 C NEURAL INFORM
  • [2] Connecting user and item perspectives in popularity debiasing for collaborative recommendation
    Boratto, Ludovico
    Fenu, Gianni
    Marras, Mirko
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2021, 58 (01)
  • [3] Bipartite Graph Embedding via Mutual Information Maximization
    Cao, Jiangxia
    Lin, Xixun
    Guo, Shu
    Liu, Luchen
    Liu, Tingwen
    Wang, Bin
    [J]. WSDM '21: PROCEEDINGS OF THE 14TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2021, : 635 - 643
  • [4] Learning Dual Dynamic Representations on Time-Sliced User-Item Interaction Graphs for Sequential Recommendation
    Chen, Zeyuan
    Zhang, Wei
    Yan, Junchi
    Wang, Gang
    Wang, Jianyong
    [J]. PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 231 - 240
  • [5] Cho K., 2014, P EMNLP ASS COMP LIN
  • [6] den Oord A., 2018, ARXIV
  • [7] Ding KZ, 2022, Arxiv, DOI arXiv:2202.08235
  • [8] Feng YF, 2019, AAAI CONF ARTIF INTE, P3558
  • [9] Deep semi-supervised learning with contrastive learning and partial label propagation for image data
    Gan, Yanglan
    Zhu, Huichun
    Guo, Wenjing
    Xu, Guangwei
    Zou, Guobing
    [J]. KNOWLEDGE-BASED SYSTEMS, 2022, 245
  • [10] Hamilton WL, 2017, ADV NEUR IN, V30