Leveraging Hyperbolic Dynamic Neural Networks for Knowledge-Aware Recommendation

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Yihao Zhang;Kaibei Li;Junlin Zhu;Meng Yuan;Yonghao Huang;Xiaokang Li
{"title":"Leveraging Hyperbolic Dynamic Neural Networks for Knowledge-Aware Recommendation","authors":"Yihao Zhang;Kaibei Li;Junlin Zhu;Meng Yuan;Yonghao Huang;Xiaokang Li","doi":"10.1109/TCSS.2024.3353467","DOIUrl":null,"url":null,"abstract":"Knowledge graph (KG) is of growing significance in enabling explainable recommendations. Recent research works involve constructing propagation-based recommendation models. Nevertheless, most of the current propagation-based recommendation methods cannot explicitly handle the diverse relations of items, resulting in the inability to model the underlying hierarchies and diverse relations, and it is difficult to capture the high-order collaborative information of items to learn premium representation. To address these issues, we leverage hyperbolic dynamic neural networks for knowledge-aware recommendation (KHDNN). Technically speaking, we embed users and items (forming user–item bipartite graphs), along with entities and relations (constituting KGs), into hyperbolic space, followed by encoding these embeddings using an encoder. The encoded embedding is passed through a hyperbolic dynamic filter to explicitly handle relations and model different relational structures. Furthermore, we design a fresh aggregation strategy based on relations to propagate and capture higher-order collaborative signals as well as knowledge associations. Meanwhile, we extract semantic information via a bilateral memory network to fuse item collaborative signals and knowledge associations. Empirical results from four datasets show that KHDNN surpasses cutting-edge baseline methods. Additionally, we demonstrate that the KHDNN can perform knowledge-aware recommendations with complex relations.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":null,"pages":null},"PeriodicalIF":4.5000,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10419067/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Knowledge graph (KG) is of growing significance in enabling explainable recommendations. Recent research works involve constructing propagation-based recommendation models. Nevertheless, most of the current propagation-based recommendation methods cannot explicitly handle the diverse relations of items, resulting in the inability to model the underlying hierarchies and diverse relations, and it is difficult to capture the high-order collaborative information of items to learn premium representation. To address these issues, we leverage hyperbolic dynamic neural networks for knowledge-aware recommendation (KHDNN). Technically speaking, we embed users and items (forming user–item bipartite graphs), along with entities and relations (constituting KGs), into hyperbolic space, followed by encoding these embeddings using an encoder. The encoded embedding is passed through a hyperbolic dynamic filter to explicitly handle relations and model different relational structures. Furthermore, we design a fresh aggregation strategy based on relations to propagate and capture higher-order collaborative signals as well as knowledge associations. Meanwhile, we extract semantic information via a bilateral memory network to fuse item collaborative signals and knowledge associations. Empirical results from four datasets show that KHDNN surpasses cutting-edge baseline methods. Additionally, we demonstrate that the KHDNN can perform knowledge-aware recommendations with complex relations.
利用双曲动态神经网络进行知识感知推荐
知识图谱(KG)在实现可解释的推荐方面具有越来越重要的意义。最近的研究工作涉及构建基于传播的推荐模型。然而,目前大多数基于传播的推荐方法无法明确处理项目的各种关系,导致无法对底层层次和各种关系进行建模,也很难捕捉项目的高阶协作信息来学习溢价表示。为了解决这些问题,我们利用双曲动态神经网络进行知识感知推荐(KHDNN)。从技术上讲,我们将用户和项目(构成用户-项目双向图)以及实体和关系(构成知识库)嵌入双曲空间,然后使用编码器对这些嵌入进行编码。编码后的嵌入将通过双曲动态过滤器来明确处理关系,并为不同的关系结构建模。此外,我们还设计了一种基于关系的全新聚合策略,以传播和捕捉高阶协作信号以及知识关联。同时,我们通过双边记忆网络提取语义信息,以融合项目协作信号和知识关联。四个数据集的实证结果表明,KHDNN 超越了最先进的基线方法。此外,我们还证明了 KHDNN 可以执行具有复杂关系的知识感知推荐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信