DTR4Rec:顺序推荐的直接过渡关系

IF 3.4 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Intelligence Pub Date : 2024-11-22 DOI:10.1007/s10489-024-05875-3
Ming He, Han Zhang, Zihao Zhang, Chang Liu
{"title":"DTR4Rec:顺序推荐的直接过渡关系","authors":"Ming He,&nbsp;Han Zhang,&nbsp;Zihao Zhang,&nbsp;Chang Liu","doi":"10.1007/s10489-024-05875-3","DOIUrl":null,"url":null,"abstract":"<div><p>Sequential recommendation aims at mining user interests through modeling sequential behaviors. Most existing sequential recommendation methods overlook the direct transition relationship among items, and only encode a user sequence as a whole, capturing the intention behind the sequence and predicting the next item with which the user might interact. However, in real-world scenarios, a small subset of items within a sequence may directly impact future interactions due to the direct transition relationship among items. To solve the above problem, in this paper, we propose a novel framework called Direct Transition Relationship for Recommendation (DTR4Rec). Specifically, we first construct a long-term direct transition matrix and a short-term co-occurrence matrix among items based on their occurrence patterns in the interaction data. The long-term direct transition matrix is constructed by counting the frequency of transitions from one item to another within a relatively long window. The short-term co-occurrence matrix is built by counting the frequency of co-occurrences of two items within a short window. We further utilize a learnable fusion approach to blend traditional sequence transition patterns with the direct transition relationship among items for predicting the next item. This integration is accomplished through a learnable fusion matrix. Additionally, in order to mitigate the data sparsity problem and enhance the generalization of the model, we propose a new paradigm for computing item similarity, which considers both collaborative filtering similarity and sequential similarity among items, then such similarity is utilized to substitute part of items in the sequence, thereby creating augmented data. We conduct extensive experiments on three real-world datasets, demonstrating that DTR4Rec outperforms state-of-the-art baselines for sequential recommendation.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 1","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DTR4Rec: direct transition relationship for sequential recommendation\",\"authors\":\"Ming He,&nbsp;Han Zhang,&nbsp;Zihao Zhang,&nbsp;Chang Liu\",\"doi\":\"10.1007/s10489-024-05875-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Sequential recommendation aims at mining user interests through modeling sequential behaviors. Most existing sequential recommendation methods overlook the direct transition relationship among items, and only encode a user sequence as a whole, capturing the intention behind the sequence and predicting the next item with which the user might interact. However, in real-world scenarios, a small subset of items within a sequence may directly impact future interactions due to the direct transition relationship among items. To solve the above problem, in this paper, we propose a novel framework called Direct Transition Relationship for Recommendation (DTR4Rec). Specifically, we first construct a long-term direct transition matrix and a short-term co-occurrence matrix among items based on their occurrence patterns in the interaction data. The long-term direct transition matrix is constructed by counting the frequency of transitions from one item to another within a relatively long window. The short-term co-occurrence matrix is built by counting the frequency of co-occurrences of two items within a short window. We further utilize a learnable fusion approach to blend traditional sequence transition patterns with the direct transition relationship among items for predicting the next item. This integration is accomplished through a learnable fusion matrix. Additionally, in order to mitigate the data sparsity problem and enhance the generalization of the model, we propose a new paradigm for computing item similarity, which considers both collaborative filtering similarity and sequential similarity among items, then such similarity is utilized to substitute part of items in the sequence, thereby creating augmented data. We conduct extensive experiments on three real-world datasets, demonstrating that DTR4Rec outperforms state-of-the-art baselines for sequential recommendation.</p></div>\",\"PeriodicalId\":8041,\"journal\":{\"name\":\"Applied Intelligence\",\"volume\":\"55 1\",\"pages\":\"\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-11-22\",\"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-024-05875-3\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-024-05875-3","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

序列推荐旨在通过对用户序列行为建模来挖掘用户兴趣。现有的序列推荐方法大多忽略了项目之间的直接转换关系,只对用户序列进行整体编码,捕捉序列背后的意图,预测用户可能与之交互的下一个项目。然而,在现实场景中,由于项目间的直接转换关系,序列中的一小部分项目可能会直接影响未来的交互。为了解决上述问题,我们在本文中提出了一种名为 "直接过渡关系推荐(DTR4Rec)"的新框架。具体来说,我们首先根据项目在交互数据中的出现模式,构建项目间的长期直接过渡矩阵和短期共现矩阵。长期直接转换矩阵是通过计算在一个相对较长的窗口内从一个项目转换到另一个项目的频率而构建的。短期共现矩阵则是通过计算两个项目在较短窗口内的共现频率来构建的。我们进一步利用可学习的融合方法,将传统的序列转换模式与项目间的直接转换关系相融合,以预测下一个项目。这种融合是通过可学习的融合矩阵实现的。此外,为了缓解数据稀疏问题并增强模型的泛化能力,我们提出了一种计算项目相似性的新范式,这种范式同时考虑了协同过滤相似性和项目间的序列相似性,然后利用这种相似性来替代序列中的部分项目,从而创建增强数据。我们在三个真实世界的数据集上进行了广泛的实验,结果表明 DTR4Rec 在顺序推荐方面的表现优于最先进的基准。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DTR4Rec: direct transition relationship for sequential recommendation

Sequential recommendation aims at mining user interests through modeling sequential behaviors. Most existing sequential recommendation methods overlook the direct transition relationship among items, and only encode a user sequence as a whole, capturing the intention behind the sequence and predicting the next item with which the user might interact. However, in real-world scenarios, a small subset of items within a sequence may directly impact future interactions due to the direct transition relationship among items. To solve the above problem, in this paper, we propose a novel framework called Direct Transition Relationship for Recommendation (DTR4Rec). Specifically, we first construct a long-term direct transition matrix and a short-term co-occurrence matrix among items based on their occurrence patterns in the interaction data. The long-term direct transition matrix is constructed by counting the frequency of transitions from one item to another within a relatively long window. The short-term co-occurrence matrix is built by counting the frequency of co-occurrences of two items within a short window. We further utilize a learnable fusion approach to blend traditional sequence transition patterns with the direct transition relationship among items for predicting the next item. This integration is accomplished through a learnable fusion matrix. Additionally, in order to mitigate the data sparsity problem and enhance the generalization of the model, we propose a new paradigm for computing item similarity, which considers both collaborative filtering similarity and sequential similarity among items, then such similarity is utilized to substitute part of items in the sequence, thereby creating augmented data. We conduct extensive experiments on three real-world datasets, demonstrating that DTR4Rec outperforms state-of-the-art baselines for sequential recommendation.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Reliability-aware label distribution learning with attention-rectified for facial expression recognition A multi-relational neighbors constructed graph neural network for heterophily graph learning PVT-MA: pyramid vision transformers with multi-attention fusion mechanism for polyp segmentation ST-NAMN: a spatial-temporal nonlinear auto-regressive multichannel neural network for traffic prediction Detrended partial cross-correlation analysis-random matrix theory for denoising network construction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1