HyperCLR: A Personalized Sequential Recommendation Algorithm Based on Hypergraph and Contrastive Learning

IF 4.6 Q2 MATERIALS SCIENCE, BIOMATERIALS
Ruiqi Zhang, Haitao Wang, Jianfeng He
{"title":"HyperCLR: A Personalized Sequential Recommendation Algorithm Based on Hypergraph and Contrastive Learning","authors":"Ruiqi Zhang, Haitao Wang, Jianfeng He","doi":"10.3390/math12182887","DOIUrl":null,"url":null,"abstract":"Sequential recommendations aim to predict users’ next interactions by modeling their interaction sequences. Most existing work concentrates on user preferences within these sequences, overlooking the complex item relationships across sequences. Additionally, these studies often fail to address the diversity of user interests, thus not capturing their varied latent preferences effectively. To tackle these problems, this paper develops a novel recommendation algorithm based on hypergraphs and contrastive learning named HyperCLR. It dynamically incorporates the time and location embeddings of items to model high-order relationships in user preferences. Moreover, we developed a graph construction approach named IFDG, which utilizes global item visit frequencies and spatial distances to discern item relevancy. By sampling subgraphs from IFDG, HyperCLR can align the representations of identical interaction sequences closely while distinguishing them from the broader global context on IFDG. This approach enhances the accuracy of sequential recommendations. Furthermore, a gating mechanism is designed to tailor the global context information to individual user preferences. Extensive experiments on Taobao, Books and Games datasets have shown that HyperCLR consistently surpasses baselines, demonstrating the effectiveness of the method. In particular, in comparison to the best baseline methods, HyperCLR demonstrated a 29.1% improvement in performance on the Taobao dataset.","PeriodicalId":2,"journal":{"name":"ACS Applied Bio Materials","volume":null,"pages":null},"PeriodicalIF":4.6000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Bio Materials","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3390/math12182887","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATERIALS SCIENCE, BIOMATERIALS","Score":null,"Total":0}
引用次数: 0

Abstract

Sequential recommendations aim to predict users’ next interactions by modeling their interaction sequences. Most existing work concentrates on user preferences within these sequences, overlooking the complex item relationships across sequences. Additionally, these studies often fail to address the diversity of user interests, thus not capturing their varied latent preferences effectively. To tackle these problems, this paper develops a novel recommendation algorithm based on hypergraphs and contrastive learning named HyperCLR. It dynamically incorporates the time and location embeddings of items to model high-order relationships in user preferences. Moreover, we developed a graph construction approach named IFDG, which utilizes global item visit frequencies and spatial distances to discern item relevancy. By sampling subgraphs from IFDG, HyperCLR can align the representations of identical interaction sequences closely while distinguishing them from the broader global context on IFDG. This approach enhances the accuracy of sequential recommendations. Furthermore, a gating mechanism is designed to tailor the global context information to individual user preferences. Extensive experiments on Taobao, Books and Games datasets have shown that HyperCLR consistently surpasses baselines, demonstrating the effectiveness of the method. In particular, in comparison to the best baseline methods, HyperCLR demonstrated a 29.1% improvement in performance on the Taobao dataset.
HyperCLR:基于超图和对比学习的个性化序列推荐算法
序列推荐旨在通过对用户的交互序列建模来预测用户的下一次交互。现有的大多数工作都集中在这些序列中的用户偏好上,而忽略了序列间复杂的项目关系。此外,这些研究往往未能解决用户兴趣的多样性问题,因此无法有效捕捉用户的各种潜在偏好。为了解决这些问题,本文开发了一种基于超图和对比学习的新型推荐算法,命名为 HyperCLR。它动态地结合了项目的时间和地点嵌入,为用户偏好中的高阶关系建模。此外,我们还开发了一种名为 IFDG 的图构建方法,它利用全局项目访问频率和空间距离来判别项目相关性。通过从 IFDG 中抽取子图,HyperCLR 可以使相同交互序列的表示紧密一致,同时将它们与 IFDG 上更广泛的全局上下文区分开来。这种方法提高了顺序推荐的准确性。此外,HyperCLR 还设计了一种门控机制,可根据用户的个人偏好定制全局上下文信息。在淘宝、图书和游戏数据集上进行的大量实验表明,HyperCLR 始终超越基线,证明了该方法的有效性。特别是,与最佳基准方法相比,HyperCLR 在淘宝数据集上的性能提高了 29.1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
ACS Applied Bio Materials
ACS Applied Bio Materials Chemistry-Chemistry (all)
CiteScore
9.40
自引率
2.10%
发文量
464
×
引用
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学术官方微信