Long and Short-Term Interest Contrastive Learning Under Filter-Enhanced Sequential Recommendation

被引:3
作者
Li, Yi [1 ]
Yang, Changchun [1 ]
Ni, Tongguang [1 ]
Zhang, Yi [1 ]
Liu, Hao [1 ]
机构
[1] Changzhou Univ, Sch Comp Sci & Artificial Intelligence, Changzhou 213164, Jiangsu, Peoples R China
关键词
Sequential recommendation; filtering algorithm; self-supervised learning; contrastive learning;
D O I
10.1109/ACCESS.2023.3286021
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Existing self-supervised sequential recommendations face the problem of noisy interactions and sparse sequence data, and train models based only on item prediction losses, so they usually fail to learn an appropriate sequential representation. In this paper, to address the above problem, we propose long and short-term interest contrastive learning under filter-enhanced sequential recommendation (FLSCSR). Specifically, a filtering algorithm is used on the user's interaction sequences to attenuate the noisy information in the sequence data. Two independent encoders are used to model the user's long-term and short-term interests separately on the filter-based enhanced interaction sequences. Then user-specific gating mechanisms are constructed to capture the long-term and short-term interests tailored to the user's personalized preferences, which are incorporated into the attention network to achieve better learning of interest representations in sequence recommendations. In addition, representation alignment learning goals are proposed to minimize the discrepancy between long-term and short-term interest representations in personalized global contexts and local sequence representations. Experiments were conducted on three public and industrial datasets, where the FLSCSR model could obtain superior performance compared to the benchmark model: AUC improves by 0.76%-2.02%, GAUC improves by 0.55%-1.01%, MRR improves by 1.19%-2.09%, and NDCG@2 improves by 1.07%-2.26%.
引用
收藏
页码:95928 / 95938
页数:11
相关论文
共 46 条
[1]  
An MX, 2019, 57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), P336
[2]  
[Anonymous], 2023, VOLUME, V11
[3]   A heterogeneous couplings and persuasive user/item information model for Next Basket recommendation [J].
Arthur, John Kingsley ;
Zhou, Conghua ;
Osei-Kwakye, Jeremiah ;
Mantey, Eric Appiah ;
Chen, Yaru .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2022, 114
[4]   A Discriminative-Based Geometric Deep Learning Model for Cross Domain Recommender Systems [J].
Arthur, John Kingsley ;
Zhou, Conghua ;
Mantey, Eric Appiah ;
Osei-Kwakye, Jeremiah ;
Chen, Yaru .
APPLIED SCIENCES-BASEL, 2022, 12 (10)
[5]  
Caruana R, 2001, ADV NEUR IN, V13, P402
[6]  
Devlin J, 2019, Arxiv, DOI [arXiv:1810.04805, 10.48550/arxiv.1810.04805]
[7]   Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformer [J].
Fan, Ziwei ;
Liu, Zhiwei ;
Zhang, Jiawei ;
Xiong, Yun ;
Zheng, Lei ;
Yu, Philip S. .
PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, :433-442
[8]   LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation [J].
He, Xiangnan ;
Deng, Kuan ;
Wang, Xiang ;
Li, Yan ;
Zhang, Yongdong ;
Wang, Meng .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :639-648
[9]   Neural Collaborative Filtering [J].
He, Xiangnan ;
Liao, Lizi ;
Zhang, Hanwang ;
Nie, Liqiang ;
Hu, Xia ;
Chua, Tat-Seng .
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, :173-182
[10]  
Hidasi B, 2016, Arxiv, DOI [arXiv:1511.06939, DOI 10.48550/ARXIV.1511.06939]