用于顺序推荐的知识增强型个性化分层注意力网络

Shuqi Ruan, Chao Yang, Dongsheng Li
{"title":"用于顺序推荐的知识增强型个性化分层注意力网络","authors":"Shuqi Ruan, Chao Yang, Dongsheng Li","doi":"10.1007/s11280-024-01236-9","DOIUrl":null,"url":null,"abstract":"<p>Sequential recommendation aims to predict the next items that users will interact with according to the sequential dependencies within historical user interactions. Recently, self-attention based sequence modeling methods have become the mainstream method due to their competitive accuracy. Despite their effectiveness, these methods still have non-trivial limitations: (1) they mainly take the transition patterns between items into consideration but ignore the semantic associations between items, and (2) they mostly focus on dynamic short-term user preferences and fail to consider user static long-term preferences explicitly. To address these limitations, we propose a Knowledge Enhanced Personalized Hierarchical Attention Network (KPHAN), which can incorporate the semantic associations among items by learning from knowledge graphs and capture the fine-grained long- and short-term interests of users through a novel personalized hierarchical attention network. Specifically, we employ the entities and relationships in the knowledge graph to enrich semantic information for items while preserving the structural information of the knowledge graph. The self-attention mechanism then captures semantic associations among items to obtain short-term user preferences more accurately. Finally, a personalized hierarchical attention network is developed to generate the final user preference representations, which can fully capture user static long-term preferences while fusing dynamic short-term preferences. Experimental results on three real-world datasets demonstrate that our method can outperform prior works by 2.7% - 35.5% on HR metrics and 6.7% - 27.9% on NDCG metrics.</p>","PeriodicalId":501180,"journal":{"name":"World Wide Web","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Knowledge-enhanced personalized hierarchical attention network for sequential recommendation\",\"authors\":\"Shuqi Ruan, Chao Yang, Dongsheng Li\",\"doi\":\"10.1007/s11280-024-01236-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Sequential recommendation aims to predict the next items that users will interact with according to the sequential dependencies within historical user interactions. Recently, self-attention based sequence modeling methods have become the mainstream method due to their competitive accuracy. Despite their effectiveness, these methods still have non-trivial limitations: (1) they mainly take the transition patterns between items into consideration but ignore the semantic associations between items, and (2) they mostly focus on dynamic short-term user preferences and fail to consider user static long-term preferences explicitly. To address these limitations, we propose a Knowledge Enhanced Personalized Hierarchical Attention Network (KPHAN), which can incorporate the semantic associations among items by learning from knowledge graphs and capture the fine-grained long- and short-term interests of users through a novel personalized hierarchical attention network. Specifically, we employ the entities and relationships in the knowledge graph to enrich semantic information for items while preserving the structural information of the knowledge graph. The self-attention mechanism then captures semantic associations among items to obtain short-term user preferences more accurately. Finally, a personalized hierarchical attention network is developed to generate the final user preference representations, which can fully capture user static long-term preferences while fusing dynamic short-term preferences. Experimental results on three real-world datasets demonstrate that our method can outperform prior works by 2.7% - 35.5% on HR metrics and 6.7% - 27.9% on NDCG metrics.</p>\",\"PeriodicalId\":501180,\"journal\":{\"name\":\"World Wide Web\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"World Wide Web\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11280-024-01236-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Wide Web","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11280-024-01236-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

序列推荐的目的是根据用户历史交互中的序列依赖关系,预测用户将与之交互的下一个项目。最近,基于自我关注的序列建模方法因其极具竞争力的准确性而成为主流方法。尽管这些方法非常有效,但仍存在一些不小的局限性:(1) 它们主要考虑了项目之间的过渡模式,却忽略了项目之间的语义关联;(2) 它们大多关注动态的短期用户偏好,却没有明确考虑用户静态的长期偏好。针对这些局限性,我们提出了一种知识增强型个性化分层注意力网络(KPHAN),它可以通过学习知识图谱来整合项目间的语义关联,并通过一种新颖的个性化分层注意力网络来捕捉用户细粒度的长期和短期兴趣。具体来说,我们利用知识图谱中的实体和关系来丰富项目的语义信息,同时保留知识图谱的结构信息。然后,自我关注机制捕捉项目之间的语义关联,从而更准确地获取用户的短期偏好。最后,我们开发了一个个性化的分层注意力网络来生成最终的用户偏好表征,它可以在融合动态短期偏好的同时充分捕捉用户的静态长期偏好。在三个真实数据集上的实验结果表明,我们的方法在 HR 指标上比之前的研究成果高出 2.7% - 35.5%,在 NDCG 指标上比之前的研究成果高出 6.7% - 27.9%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Knowledge-enhanced personalized hierarchical attention network for sequential recommendation

Sequential recommendation aims to predict the next items that users will interact with according to the sequential dependencies within historical user interactions. Recently, self-attention based sequence modeling methods have become the mainstream method due to their competitive accuracy. Despite their effectiveness, these methods still have non-trivial limitations: (1) they mainly take the transition patterns between items into consideration but ignore the semantic associations between items, and (2) they mostly focus on dynamic short-term user preferences and fail to consider user static long-term preferences explicitly. To address these limitations, we propose a Knowledge Enhanced Personalized Hierarchical Attention Network (KPHAN), which can incorporate the semantic associations among items by learning from knowledge graphs and capture the fine-grained long- and short-term interests of users through a novel personalized hierarchical attention network. Specifically, we employ the entities and relationships in the knowledge graph to enrich semantic information for items while preserving the structural information of the knowledge graph. The self-attention mechanism then captures semantic associations among items to obtain short-term user preferences more accurately. Finally, a personalized hierarchical attention network is developed to generate the final user preference representations, which can fully capture user static long-term preferences while fusing dynamic short-term preferences. Experimental results on three real-world datasets demonstrate that our method can outperform prior works by 2.7% - 35.5% on HR metrics and 6.7% - 27.9% on NDCG metrics.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
HetFS: a method for fast similarity search with ad-hoc meta-paths on heterogeneous information networks A SHAP-based controversy analysis through communities on Twitter pFind: Privacy-preserving lost object finding in vehicular crowdsensing Use of prompt-based learning for code-mixed and code-switched text classification Drug traceability system based on semantic blockchain and on a reputation method
×
引用
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