Lighter Sequential Recommendation Algorithm With Time Interval Awareness Augmentation

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-10-25 DOI:10.1109/TSC.2024.3479911
Xiaoyao Zheng;Xingwang Li;Shengfei Jiang;Zhenghua Chen;Liping Sun;Qingying Yu;Liangmin Guo;Yonglong Luo
{"title":"Lighter Sequential Recommendation Algorithm With Time Interval Awareness Augmentation","authors":"Xiaoyao Zheng;Xingwang Li;Shengfei Jiang;Zhenghua Chen;Liping Sun;Qingying Yu;Liangmin Guo;Yonglong Luo","doi":"10.1109/TSC.2024.3479911","DOIUrl":null,"url":null,"abstract":"Sequential recommendation models analyze users’ historical interactions to predict the next item they will en gage with. In order to better capture users’ dynamic interest preferences, most existing sequential recommendation models that introduce heterogeneous time intervals lead to increased model complexity, which raises computational costs and training difficulty. This is particularly evident in long sequential data, where the model need to handle a large variety of different time intervals. Additionally, accurately modeling the impact of long time intervals on user behavior remains a significant challenge. To address these issues, we propose a lightweight sequential recommendation algorithm with time interval awareness augmen tation (TALSAN). This model introduces a novel uniform data augmentation operator to improve the distribution of original data samples and employs a time-aware self-attention layer to model user interactions, maintaining the continuity of the original sequence. By integrating temporal context with posi tional features, TALSAN constructs a streamlined self-attention network for predicting user behavior. Comparative testing on datasets such as ML-100K, ML-1M, Amazon Beauty, Amazon Toys, and Amazon Fashion demonstrates the model’s superiority over existing baselines. Our results confirm that TALSAN not only mitigates cold start issues but also enhances the ability to learn user preferences, leading to improved prediction accuracy.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"17 6","pages":"3857-3868"},"PeriodicalIF":5.5000,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10735404/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Sequential recommendation models analyze users’ historical interactions to predict the next item they will en gage with. In order to better capture users’ dynamic interest preferences, most existing sequential recommendation models that introduce heterogeneous time intervals lead to increased model complexity, which raises computational costs and training difficulty. This is particularly evident in long sequential data, where the model need to handle a large variety of different time intervals. Additionally, accurately modeling the impact of long time intervals on user behavior remains a significant challenge. To address these issues, we propose a lightweight sequential recommendation algorithm with time interval awareness augmen tation (TALSAN). This model introduces a novel uniform data augmentation operator to improve the distribution of original data samples and employs a time-aware self-attention layer to model user interactions, maintaining the continuity of the original sequence. By integrating temporal context with posi tional features, TALSAN constructs a streamlined self-attention network for predicting user behavior. Comparative testing on datasets such as ML-100K, ML-1M, Amazon Beauty, Amazon Toys, and Amazon Fashion demonstrates the model’s superiority over existing baselines. Our results confirm that TALSAN not only mitigates cold start issues but also enhances the ability to learn user preferences, leading to improved prediction accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
增强时间间隔意识的轻量级顺序推荐算法
顺序推荐模型分析用户的历史交互,以预测他们将参与的下一个项目。为了更好地捕捉用户的动态兴趣偏好,现有的序列推荐模型大多引入了异构时间间隔,导致模型复杂度增加,从而增加了计算成本和训练难度。这在长序列数据中尤其明显,因为模型需要处理大量不同的时间间隔。此外,准确建模长时间间隔对用户行为的影响仍然是一个重大挑战。为了解决这些问题,我们提出了一种具有时间间隔感知增强的轻量级顺序推荐算法(TALSAN)。该模型引入了一种新颖的统一数据增强算子来改善原始数据样本的分布,并采用时间感知的自关注层来建模用户交互,保持原始序列的连续性。TALSAN通过整合时间上下文和位置特征,构建了一个流线型的自注意网络来预测用户行为。在ML-100K、ML-1M、Amazon Beauty、Amazon Toys和Amazon Fashion等数据集上的对比测试表明,该模型优于现有基线。我们的研究结果证实,TALSAN不仅减轻了冷启动问题,而且增强了学习用户偏好的能力,从而提高了预测精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
A Malicious Information Popularity Prediction Model Based on User Influence Joint Trajectory Optimization and Resource Allocation in UAV-MEC Systems: A Lyapunov-Assisted DRL Approach Leveraging Consortium Blockchain for Secure Cross-domain Data Sharing in Supply Chain Networks An Adaptively Bias-Extended Non-negative Latent Factorization of Tensors Model for Accurately Representing the Dynamic QoS Data Learning Schema Embeddings for Service Link Prediction: A Coupled Matrix-Tensor Factorization Approach
×
引用
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