HMKRec:通过超图主题优化多用户表示,用于知识感知推荐

IF 8 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Di Wu , Mingjing Tang , Shu Zhang , Wei Gao
{"title":"HMKRec:通过超图主题优化多用户表示,用于知识感知推荐","authors":"Di Wu ,&nbsp;Mingjing Tang ,&nbsp;Shu Zhang ,&nbsp;Wei Gao","doi":"10.1016/j.engappai.2025.110441","DOIUrl":null,"url":null,"abstract":"<div><div>Knowledge graph-based recommender systems can explore users’ potential interests by learning user similarities, thereby further improving recommendation performance. However, existing methods focus only on the similarity between two users without considering the interaction patterns among multiple users, which overlook the influence of other users in user representation modeling. In this paper, we propose a novel framework using Hypergraph Motifs to optimize Multi-users representation for Recommendation (HMKRec). Specifically, HMKRec constructs a user–item hypergraph and maps it into a user–user adjacency graph. Then, it utilizes hypergraph motifs to model the interaction patterns of multiple users and reconstructs an implicit relationship network with weights and directions to explore high-order associations among multiple users. To learn the features of items and user relationships, we design a hierarchical graph convolution that integrates hypergraph convolutional networks and graph convolutional networks to obtain high-order representations of users. Finally, we propagate user preferences in the knowledge graph using the attention mechanism to obtain high-order representations of items for recommendation. Extensive experiments on three real-world datasets indicate that our method achieves at least a 1% performance improvement over the best-performing state-of-the-art baselines.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"149 ","pages":"Article 110441"},"PeriodicalIF":8.0000,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"HMKRec: Optimize multi-user representation by hypergraph motifs for knowledge-aware recommendation\",\"authors\":\"Di Wu ,&nbsp;Mingjing Tang ,&nbsp;Shu Zhang ,&nbsp;Wei Gao\",\"doi\":\"10.1016/j.engappai.2025.110441\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Knowledge graph-based recommender systems can explore users’ potential interests by learning user similarities, thereby further improving recommendation performance. However, existing methods focus only on the similarity between two users without considering the interaction patterns among multiple users, which overlook the influence of other users in user representation modeling. In this paper, we propose a novel framework using Hypergraph Motifs to optimize Multi-users representation for Recommendation (HMKRec). Specifically, HMKRec constructs a user–item hypergraph and maps it into a user–user adjacency graph. Then, it utilizes hypergraph motifs to model the interaction patterns of multiple users and reconstructs an implicit relationship network with weights and directions to explore high-order associations among multiple users. To learn the features of items and user relationships, we design a hierarchical graph convolution that integrates hypergraph convolutional networks and graph convolutional networks to obtain high-order representations of users. Finally, we propagate user preferences in the knowledge graph using the attention mechanism to obtain high-order representations of items for recommendation. Extensive experiments on three real-world datasets indicate that our method achieves at least a 1% performance improvement over the best-performing state-of-the-art baselines.</div></div>\",\"PeriodicalId\":50523,\"journal\":{\"name\":\"Engineering Applications of Artificial Intelligence\",\"volume\":\"149 \",\"pages\":\"Article 110441\"},\"PeriodicalIF\":8.0000,\"publicationDate\":\"2025-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Applications of Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0952197625004415\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0952197625004415","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

基于知识图的推荐系统可以通过学习用户的相似度来挖掘用户的潜在兴趣,从而进一步提高推荐性能。然而,现有的方法只关注两个用户之间的相似度,而没有考虑多个用户之间的交互模式,忽略了其他用户对用户表示建模的影响。在本文中,我们提出了一个利用超图母题来优化多用户推荐表示(HMKRec)的新框架。具体来说,HMKRec构造了一个用户-项目超图,并将其映射到一个用户-用户邻接图。然后,利用超图基元对多用户交互模式进行建模,重构具有权重和方向的隐式关系网络,探索多用户之间的高阶关联。为了学习项目的特征和用户关系,我们设计了一个层次图卷积,它集成了超图卷积网络和图卷积网络,以获得用户的高阶表示。最后,我们使用注意机制在知识图中传播用户偏好,以获得用于推荐的项目的高阶表示。在三个真实世界数据集上的广泛实验表明,我们的方法比性能最好的最先进的基线至少提高了1%的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
HMKRec: Optimize multi-user representation by hypergraph motifs for knowledge-aware recommendation
Knowledge graph-based recommender systems can explore users’ potential interests by learning user similarities, thereby further improving recommendation performance. However, existing methods focus only on the similarity between two users without considering the interaction patterns among multiple users, which overlook the influence of other users in user representation modeling. In this paper, we propose a novel framework using Hypergraph Motifs to optimize Multi-users representation for Recommendation (HMKRec). Specifically, HMKRec constructs a user–item hypergraph and maps it into a user–user adjacency graph. Then, it utilizes hypergraph motifs to model the interaction patterns of multiple users and reconstructs an implicit relationship network with weights and directions to explore high-order associations among multiple users. To learn the features of items and user relationships, we design a hierarchical graph convolution that integrates hypergraph convolutional networks and graph convolutional networks to obtain high-order representations of users. Finally, we propagate user preferences in the knowledge graph using the attention mechanism to obtain high-order representations of items for recommendation. Extensive experiments on three real-world datasets indicate that our method achieves at least a 1% performance improvement over the best-performing state-of-the-art baselines.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信