动态推荐知识图中的传播交互影响

IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Chunjing Xiao, Wanlin Ji, Yuxiang Zhang, Shenkai Lv
{"title":"动态推荐知识图中的传播交互影响","authors":"Chunjing Xiao, Wanlin Ji, Yuxiang Zhang, Shenkai Lv","doi":"https://dl.acm.org/doi/10.1145/3593314","DOIUrl":null,"url":null,"abstract":"<p>Modelling the dynamic interactions between users and items on knowledge graphs is very crucial for improving the accuracy of recommendation. Although existing methods have made great progress in modelling the dynamic knowledge graphs for recommendation, they usually only consider the mutual influence between users and items involved in the interactions, and ignore the influence propagation from the interacting nodes (<i>i.e.</i>, users and items) on dynamic knowledge graphs. In this paper, we propose an influence propagation-enhanced deep coevolutionary method for recommendation, which can capture not only the direct mutual influence between interacting users and items but also <i>influence propagation</i> from multiple interacting nodes to their high-order neighbors at the same time on the dynamic knowledge graph. Specifically, the proposed model consists of two main components: <i>direct mutual influence component</i> and <i>influence propagation component.</i>\nThe former captures direct interaction influence between the interacting users and items to generate the effective representations for them. The latter refines their representations via aggregating the interaction influence propagated from multiple interacting nodes. In this process, a neighbor selection mechanism is designed for selecting more effective propagation influence, which can significantly reduce the computational cost and accelerate the training. Finally, the refined representations of users and items are used to predict which item the user is most likely to interact with. The experimental results on three real-world datasets illustrate that the effectiveness and robustness of PIDKG outperform all the state-of-the-art baselines and the efficiency of it is faster than most of comparative baselines.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 24","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2023-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PIDKG: Propagating Interaction Influence on the Dynamic Knowledge Graph for Recommendation\",\"authors\":\"Chunjing Xiao, Wanlin Ji, Yuxiang Zhang, Shenkai Lv\",\"doi\":\"https://dl.acm.org/doi/10.1145/3593314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Modelling the dynamic interactions between users and items on knowledge graphs is very crucial for improving the accuracy of recommendation. Although existing methods have made great progress in modelling the dynamic knowledge graphs for recommendation, they usually only consider the mutual influence between users and items involved in the interactions, and ignore the influence propagation from the interacting nodes (<i>i.e.</i>, users and items) on dynamic knowledge graphs. In this paper, we propose an influence propagation-enhanced deep coevolutionary method for recommendation, which can capture not only the direct mutual influence between interacting users and items but also <i>influence propagation</i> from multiple interacting nodes to their high-order neighbors at the same time on the dynamic knowledge graph. Specifically, the proposed model consists of two main components: <i>direct mutual influence component</i> and <i>influence propagation component.</i>\\nThe former captures direct interaction influence between the interacting users and items to generate the effective representations for them. The latter refines their representations via aggregating the interaction influence propagated from multiple interacting nodes. In this process, a neighbor selection mechanism is designed for selecting more effective propagation influence, which can significantly reduce the computational cost and accelerate the training. Finally, the refined representations of users and items are used to predict which item the user is most likely to interact with. The experimental results on three real-world datasets illustrate that the effectiveness and robustness of PIDKG outperform all the state-of-the-art baselines and the efficiency of it is faster than most of comparative baselines.</p>\",\"PeriodicalId\":50940,\"journal\":{\"name\":\"ACM Transactions on the Web\",\"volume\":\"43 24\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2023-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on the Web\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/https://dl.acm.org/doi/10.1145/3593314\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on the Web","FirstCategoryId":"94","ListUrlMain":"https://doi.org/https://dl.acm.org/doi/10.1145/3593314","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在知识图谱上对用户和项目之间的动态交互进行建模对于提高推荐的准确性至关重要。虽然现有的方法在动态知识图的推荐建模方面取得了很大的进展,但它们通常只考虑交互中涉及的用户和项目之间的相互影响,而忽略了交互节点(即用户和项目)在动态知识图上的影响传播。本文提出了一种影响传播增强的深度协同进化推荐方法,该方法不仅可以捕获交互用户和项目之间的直接相互影响,还可以在动态知识图上捕获多个交互节点同时向其高阶邻居的影响传播。具体而言,该模型由直接相互影响组件和影响传播组件组成。前者捕获交互用户和项目之间的直接交互影响,为他们生成有效的表示。后者通过聚合从多个交互节点传播的交互影响来改进它们的表示。在此过程中,设计了一种邻居选择机制,选择更有效的传播影响,可以显著降低计算成本,加快训练速度。最后,使用用户和项目的精炼表示来预测用户最有可能与哪个项目交互。在三个真实数据集上的实验结果表明,PIDKG的有效性和鲁棒性优于所有最先进的基线,并且其效率比大多数比较基线更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PIDKG: Propagating Interaction Influence on the Dynamic Knowledge Graph for Recommendation

Modelling the dynamic interactions between users and items on knowledge graphs is very crucial for improving the accuracy of recommendation. Although existing methods have made great progress in modelling the dynamic knowledge graphs for recommendation, they usually only consider the mutual influence between users and items involved in the interactions, and ignore the influence propagation from the interacting nodes (i.e., users and items) on dynamic knowledge graphs. In this paper, we propose an influence propagation-enhanced deep coevolutionary method for recommendation, which can capture not only the direct mutual influence between interacting users and items but also influence propagation from multiple interacting nodes to their high-order neighbors at the same time on the dynamic knowledge graph. Specifically, the proposed model consists of two main components: direct mutual influence component and influence propagation component. The former captures direct interaction influence between the interacting users and items to generate the effective representations for them. The latter refines their representations via aggregating the interaction influence propagated from multiple interacting nodes. In this process, a neighbor selection mechanism is designed for selecting more effective propagation influence, which can significantly reduce the computational cost and accelerate the training. Finally, the refined representations of users and items are used to predict which item the user is most likely to interact with. The experimental results on three real-world datasets illustrate that the effectiveness and robustness of PIDKG outperform all the state-of-the-art baselines and the efficiency of it is faster than most of comparative baselines.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on the Web
ACM Transactions on the Web 工程技术-计算机:软件工程
CiteScore
4.90
自引率
0.00%
发文量
26
审稿时长
7.5 months
期刊介绍: Transactions on the Web (TWEB) is a journal publishing refereed articles reporting the results of research on Web content, applications, use, and related enabling technologies. Topics in the scope of TWEB include but are not limited to the following: Browsers and Web Interfaces; Electronic Commerce; Electronic Publishing; Hypertext and Hypermedia; Semantic Web; Web Engineering; Web Services; and Service-Oriented Computing XML. In addition, papers addressing the intersection of the following broader technologies with the Web are also in scope: Accessibility; Business Services Education; Knowledge Management and Representation; Mobility and pervasive computing; Performance and scalability; Recommender systems; Searching, Indexing, Classification, Retrieval and Querying, Data Mining and Analysis; Security and Privacy; and User Interfaces. Papers discussing specific Web technologies, applications, content generation and management and use are within scope. Also, papers describing novel applications of the web as well as papers on the underlying technologies are welcome.
×
引用
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学术官方微信