Attention Mechanism indicating Item Novelty for Sequential Recommendation

Li-Chia Wang, Hao-Shang Ma, Jen-Wei Huang
{"title":"Attention Mechanism indicating Item Novelty for Sequential Recommendation","authors":"Li-Chia Wang, Hao-Shang Ma, Jen-Wei Huang","doi":"10.1109/ASONAM55673.2022.10068599","DOIUrl":null,"url":null,"abstract":"Most sequential recommendation systems, including those that employ a variety of features and state-of-the-art network models, tend to favor items that are the most popular or of greatest relevance to the historic behavior of the user. Recommendations made under these conditions tend to be repetitive; i.e., many options that might be of interest to users are entirely disregarded. This paper presents a novel algorithm that assigns a novelty score to potential recommendation items. We also present an architecture by which to incorporate this functionality in existing recommendation systems. In experiments, the proposed NASM system outperformed state-of-the-art sequential recommender systems, thereby verifying that the inclusion of novelty score can indeed improve recommendation performance.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASONAM55673.2022.10068599","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Most sequential recommendation systems, including those that employ a variety of features and state-of-the-art network models, tend to favor items that are the most popular or of greatest relevance to the historic behavior of the user. Recommendations made under these conditions tend to be repetitive; i.e., many options that might be of interest to users are entirely disregarded. This paper presents a novel algorithm that assigns a novelty score to potential recommendation items. We also present an architecture by which to incorporate this functionality in existing recommendation systems. In experiments, the proposed NASM system outperformed state-of-the-art sequential recommender systems, thereby verifying that the inclusion of novelty score can indeed improve recommendation performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
顺序推荐中指示项目新颖性的注意机制
大多数顺序推荐系统,包括那些采用各种功能和最先进的网络模型的系统,倾向于支持最受欢迎或与用户历史行为最相关的项目。在这种情况下提出的建议往往是重复的;也就是说,许多用户可能感兴趣的选项完全被忽略了。本文提出了一种新的算法,为潜在的推荐项目分配新颖性分数。我们还提出了一个架构,通过该架构可以将此功能整合到现有的推荐系统中。在实验中,所提出的NASM系统优于最先进的顺序推荐系统,从而验证了包含新颖性评分确实可以提高推荐性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
Base of tongue squamous cell carcinomas, outcome depending on treatment strategy and p16 status. A population-based study from the Swedish Head and Neck Cancer Register.
IF 3.1 3区 医学Acta OncologicaPub Date : 2022-04-01 DOI: 10.1080/0284186X.2022.2027516
Anders Högmo, Erik Holmberg, Hedda Haugen Cange, Johan Reizenstein, Johan Wennerberg, Martin Beran, Karin Söderkvist, Eva Hammerlid, Helena Sjödin, Lovisa Farnebo, Karl Sandström, Lalle Hammarstedt-Nordenvall, Katarina Zborayova, Eva Brun
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MOGPlay: A Decentralized Crowd Journalism Application for Democratic News Production The Pursuit of Being Heard: An Unsupervised Approach to Narrative Detection in Online Protest ASONAM 2022 Tutorial I: Mining and Analysing Collaboration in git Repositories with git2net Multigraph transformation for community detection applied to financial services Whole-File Chunk-Based Deduplication Using Reinforcement Learning for Cloud Storage
×
引用
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