Learning unified denoised representations for sequential recommendation

IF 3.4 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Runsen Jiang, Jiajin Huang, Yadong Xiao, Jian Yang
{"title":"Learning unified denoised representations for sequential recommendation","authors":"Runsen Jiang,&nbsp;Jiajin Huang,&nbsp;Yadong Xiao,&nbsp;Jian Yang","doi":"10.1007/s10489-025-06597-w","DOIUrl":null,"url":null,"abstract":"<div><p>Sequential Recommendation (SR) has been widely used in many internet applications, such as e-commerce, social platforms and hot news. User behavior sequential data in SR typically contains complex patterns of short-term dependencies, long-term dependencies and noise, which may lead SR models to misinterpret user intentions and overfit noisy patterns, but existing methods cannot solve them simultaneously. To address this problem, we propose a model to learn <b>Uni</b>fied <b>D</b>enoised <b>R</b>epresentations (<b>UniDR</b>) for the SR task, which consists of three modules. The first module employs Graph Neural Networks (GNNs) with adaptive learning mechanisms to capture short-term dependencies by dynamically weighting item transitions. The second module utilizes self-attention mechanisms to effectively model long-term dependencies across the entire item sequence. The third module focuses on extracting long-term sequential patterns from contextual information through feed-forward networks. Each module independently generates denoised representations, either through weak edge removal in GNNs or through frequency domain transformations. UniDR integrates these denoised representations by jointly optimizing a BPR loss, an alignment loss and a uniformity loss. Extensive experiments on five public benchmark datasets demonstrate UniDR’s superiority in recommendation performance and robustness to interaction noise. Compared to the strongest state-of-the-art baseline, UniDR achieves significant improvements, with average increases of 10.63% in Hit Rate (HR), 21.47% in Normalized Discounted Cumulative Gain (NDCG) and 23.71% in Mean Reciprocal Rank (MRR).</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 10","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-025-06597-w","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Sequential Recommendation (SR) has been widely used in many internet applications, such as e-commerce, social platforms and hot news. User behavior sequential data in SR typically contains complex patterns of short-term dependencies, long-term dependencies and noise, which may lead SR models to misinterpret user intentions and overfit noisy patterns, but existing methods cannot solve them simultaneously. To address this problem, we propose a model to learn Unified Denoised Representations (UniDR) for the SR task, which consists of three modules. The first module employs Graph Neural Networks (GNNs) with adaptive learning mechanisms to capture short-term dependencies by dynamically weighting item transitions. The second module utilizes self-attention mechanisms to effectively model long-term dependencies across the entire item sequence. The third module focuses on extracting long-term sequential patterns from contextual information through feed-forward networks. Each module independently generates denoised representations, either through weak edge removal in GNNs or through frequency domain transformations. UniDR integrates these denoised representations by jointly optimizing a BPR loss, an alignment loss and a uniformity loss. Extensive experiments on five public benchmark datasets demonstrate UniDR’s superiority in recommendation performance and robustness to interaction noise. Compared to the strongest state-of-the-art baseline, UniDR achieves significant improvements, with average increases of 10.63% in Hit Rate (HR), 21.47% in Normalized Discounted Cumulative Gain (NDCG) and 23.71% in Mean Reciprocal Rank (MRR).

学习统一的去噪表示用于顺序推荐
顺序推荐在电子商务、社交平台、热点新闻等互联网应用中得到了广泛的应用。SR中的用户行为序列数据通常包含短期依赖、长期依赖和噪声的复杂模式,这可能导致SR模型对用户意图的误解和噪声模式的过拟合,但现有方法无法同时解决这些问题。为了解决这个问题,我们提出了一个学习SR任务的统一去噪表示(UniDR)的模型,该模型由三个模块组成。第一个模块采用具有自适应学习机制的图神经网络(gnn),通过动态加权项目转换来捕获短期依赖关系。第二个模块利用自我注意机制有效地对整个项目序列的长期依赖关系进行建模。第三个模块侧重于通过前馈网络从上下文信息中提取长期顺序模式。每个模块通过gnn中的弱边缘去除或通过频域变换独立地生成去噪表示。UniDR通过联合优化BPR损失、对准损失和均匀性损失来集成这些去噪的表示。在五个公共基准数据集上的大量实验表明,UniDR在推荐性能和对交互噪声的鲁棒性方面具有优势。与最先进的基线相比,UniDR取得了显著的进步,命中率(HR)平均提高10.63%,标准化贴现累积增益(NDCG)平均提高21.47%,平均倒数等级(MRR)平均提高23.71%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信