Chunjing Xiao, Wanlin Ji, Yuxiang Zhang, Shenkai Lv
{"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}
引用次数: 0
Abstract
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.
期刊介绍:
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.