面向推荐的双曲协同知识图学习

IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neurocomputing Pub Date : 2025-06-14 Epub Date: 2025-03-03 DOI:10.1016/j.neucom.2025.129808
Huijuan Hu , Chaobo He , Xinran Chen , Quanlong Guan
{"title":"面向推荐的双曲协同知识图学习","authors":"Huijuan Hu ,&nbsp;Chaobo He ,&nbsp;Xinran Chen ,&nbsp;Quanlong Guan","doi":"10.1016/j.neucom.2025.129808","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, the integration of knowledge graph and recommendation system has become a hot topic. Its popular solution is firstly combining the knowledge graph and user–item interaction graph to generate a unified Collaborative Knowledge Graph (CKG), and then learn the representations of users and items by applying graph convolutional networks to aggregate high-order neighbor information between entities in CKG. However, existing related methods mainly focus on learning representations in the Euclidean space, posing challenges in capturing the hierarchical structure and intricate relational logic between users and items. In view of this, we propose a novel hyperbolic CKG learning model HCKGL for recommendation, which leverages relation-specific curvature and attention-based geometric transformations to preserve the inherent features of CKG. Additionally, we address two significant challenges that existing methods have often overlooked. Firstly, in order to capture the relationship dependencies between neighbors and accurately calculate the contribution of neighbor information, we propose a hyperbolic graph attention network (HGAT), which combines the curvature of the relationship to assign weights. Secondly, we present a new graph contrastive learning technique (HMCL) that utilizes the hyperbolic embedding propagation and multi-level contrastive learning to improve the representations of users and items. Comprehensive experimental results on two widely used datasets demonstrate that HCKGL outperforms state-of-the-art baselines. The source code for our model is publicly available at: <span><span>https://github.com/GDM-SCNU/HCKGL</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"634 ","pages":"Article 129808"},"PeriodicalIF":6.5000,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"HCKGL: Hyperbolic collaborative knowledge graph learning for recommendation\",\"authors\":\"Huijuan Hu ,&nbsp;Chaobo He ,&nbsp;Xinran Chen ,&nbsp;Quanlong Guan\",\"doi\":\"10.1016/j.neucom.2025.129808\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Recently, the integration of knowledge graph and recommendation system has become a hot topic. Its popular solution is firstly combining the knowledge graph and user–item interaction graph to generate a unified Collaborative Knowledge Graph (CKG), and then learn the representations of users and items by applying graph convolutional networks to aggregate high-order neighbor information between entities in CKG. However, existing related methods mainly focus on learning representations in the Euclidean space, posing challenges in capturing the hierarchical structure and intricate relational logic between users and items. In view of this, we propose a novel hyperbolic CKG learning model HCKGL for recommendation, which leverages relation-specific curvature and attention-based geometric transformations to preserve the inherent features of CKG. Additionally, we address two significant challenges that existing methods have often overlooked. Firstly, in order to capture the relationship dependencies between neighbors and accurately calculate the contribution of neighbor information, we propose a hyperbolic graph attention network (HGAT), which combines the curvature of the relationship to assign weights. Secondly, we present a new graph contrastive learning technique (HMCL) that utilizes the hyperbolic embedding propagation and multi-level contrastive learning to improve the representations of users and items. Comprehensive experimental results on two widely used datasets demonstrate that HCKGL outperforms state-of-the-art baselines. The source code for our model is publicly available at: <span><span>https://github.com/GDM-SCNU/HCKGL</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"634 \",\"pages\":\"Article 129808\"},\"PeriodicalIF\":6.5000,\"publicationDate\":\"2025-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neurocomputing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925231225004801\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/3/3 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225004801","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

近年来,知识图谱与推荐系统的集成已成为研究的热点。其流行的解决方案是首先将知识图与用户-物品交互图结合,生成统一的协同知识图(CKG),然后利用图卷积网络对CKG中实体之间的高阶邻居信息进行聚合,学习用户和物品的表示。然而,现有的相关方法主要集中在欧几里得空间中表征的学习,在捕获用户与项目之间的层次结构和复杂的关系逻辑方面存在挑战。鉴于此,我们提出了一种新的双曲CKG学习模型HCKGL进行推荐,该模型利用关系特定曲率和基于注意的几何变换来保留CKG的固有特征。此外,我们解决了现有方法经常忽略的两个重大挑战。首先,为了捕获邻居之间的关系依赖关系并准确计算邻居信息的贡献,我们提出了一种双曲图关注网络(HGAT),该网络结合关系的曲率来分配权重;其次,我们提出了一种新的图对比学习技术(HMCL),该技术利用双曲嵌入传播和多层次对比学习来改进用户和项目的表示。在两个广泛使用的数据集上的综合实验结果表明,HCKGL优于最先进的基线。我们的模型的源代码可以在:https://github.com/GDM-SCNU/HCKGL上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
HCKGL: Hyperbolic collaborative knowledge graph learning for recommendation
Recently, the integration of knowledge graph and recommendation system has become a hot topic. Its popular solution is firstly combining the knowledge graph and user–item interaction graph to generate a unified Collaborative Knowledge Graph (CKG), and then learn the representations of users and items by applying graph convolutional networks to aggregate high-order neighbor information between entities in CKG. However, existing related methods mainly focus on learning representations in the Euclidean space, posing challenges in capturing the hierarchical structure and intricate relational logic between users and items. In view of this, we propose a novel hyperbolic CKG learning model HCKGL for recommendation, which leverages relation-specific curvature and attention-based geometric transformations to preserve the inherent features of CKG. Additionally, we address two significant challenges that existing methods have often overlooked. Firstly, in order to capture the relationship dependencies between neighbors and accurately calculate the contribution of neighbor information, we propose a hyperbolic graph attention network (HGAT), which combines the curvature of the relationship to assign weights. Secondly, we present a new graph contrastive learning technique (HMCL) that utilizes the hyperbolic embedding propagation and multi-level contrastive learning to improve the representations of users and items. Comprehensive experimental results on two widely used datasets demonstrate that HCKGL outperforms state-of-the-art baselines. The source code for our model is publicly available at: https://github.com/GDM-SCNU/HCKGL.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
期刊最新文献
TF-GNN: A temporal feedback graph neural network with discriminative regularization for heterogeneous fraud detection FSSG: Generative few-shot object detection via style-geometry fusion High-fidelity backdoor watermark embedding framework for classification models in heterogeneous tabular data Newtonian neural ordinary differential equations method for dynamics identification of serial manipulators with LuGre friction Diff-DMamIR: A diffusion empowered dynamic fine-guided mamba for image restoration
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1