基于知识的推荐的拆分和重组网络

Weifeng Zhang, Yi Cao, Congfu Xu
{"title":"基于知识的推荐的拆分和重组网络","authors":"Weifeng Zhang, Yi Cao, Congfu Xu","doi":"10.1109/ICTAI.2019.00096","DOIUrl":null,"url":null,"abstract":"Utilizing knowledge graphs (KGs) to improve the performance of recommender systems has attracted increasing attention recently. Existing path-based methods rely heavily on manually designed meta-paths, while embedding-based methods focus on incorporating the knowledge graph embeddings (KGE) into recommender systems, but rarely model user-entity interactions, which can be used to enhance the performance of recommendation. To overcome the shortcomings of previous works, we propose SARC, an embedding-based model that utilizes a novel Split-And-ReCombine strategy for knowledge-based recommendation. Firstly, SARC splits the user-item-entity interactions into three 2-way interactions, i.e., the user-item, user-entity and item-entity interactions. Each of the 2-way interactions can be cast as a graph, and we use Graph Neural Networks (GNN) and KGE to model them. Secondly, SARC recombines the representation of users and items learned from the first step to generates recommendation. In order to distinguish the informative part and meaningless part of the representations, we utilize a gated fusion mechanism. The advantage of our SARC model is that through splitting, we can easily handle and make full use of the 2-way interactions, especially the user-entity interactions, and through recombining, we can extract the most useful information for recommendation. Extensive experiments on three real-world datasets demonstrate that SARC outperforms several state-of-the-art baselines.","PeriodicalId":346657,"journal":{"name":"2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"SARC: Split-and-Recombine Networks for Knowledge-Based Recommendation\",\"authors\":\"Weifeng Zhang, Yi Cao, Congfu Xu\",\"doi\":\"10.1109/ICTAI.2019.00096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Utilizing knowledge graphs (KGs) to improve the performance of recommender systems has attracted increasing attention recently. Existing path-based methods rely heavily on manually designed meta-paths, while embedding-based methods focus on incorporating the knowledge graph embeddings (KGE) into recommender systems, but rarely model user-entity interactions, which can be used to enhance the performance of recommendation. To overcome the shortcomings of previous works, we propose SARC, an embedding-based model that utilizes a novel Split-And-ReCombine strategy for knowledge-based recommendation. Firstly, SARC splits the user-item-entity interactions into three 2-way interactions, i.e., the user-item, user-entity and item-entity interactions. Each of the 2-way interactions can be cast as a graph, and we use Graph Neural Networks (GNN) and KGE to model them. Secondly, SARC recombines the representation of users and items learned from the first step to generates recommendation. In order to distinguish the informative part and meaningless part of the representations, we utilize a gated fusion mechanism. The advantage of our SARC model is that through splitting, we can easily handle and make full use of the 2-way interactions, especially the user-entity interactions, and through recombining, we can extract the most useful information for recommendation. Extensive experiments on three real-world datasets demonstrate that SARC outperforms several state-of-the-art baselines.\",\"PeriodicalId\":346657,\"journal\":{\"name\":\"2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2019.00096\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2019.00096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,利用知识图(knowledge graphs, KGs)来提高推荐系统的性能越来越受到人们的关注。现有的基于路径的方法严重依赖于人工设计的元路径,而基于嵌入的方法侧重于将知识图嵌入(KGE)集成到推荐系统中,但很少建模用户-实体交互,这可以用来提高推荐的性能。为了克服以往工作的不足,我们提出了SARC,这是一种基于嵌入的模型,它利用了一种新颖的拆分和重组策略来进行基于知识的推荐。首先,SARC将用户-物品-实体交互划分为三种双向交互,即用户-物品、用户-实体和物品-实体交互。每个双向交互都可以被转换成一个图,我们使用图神经网络(GNN)和KGE对它们进行建模。其次,SARC将第一步学习到的用户和项目的表示进行重组,生成推荐。为了区分表征中的信息部分和无意义部分,我们采用了门控融合机制。我们的SARC模型的优点是,通过拆分,我们可以很容易地处理和充分利用双向交互,特别是用户-实体交互,通过重组,我们可以提取出最有用的信息进行推荐。在三个真实世界数据集上进行的广泛实验表明,SARC优于几个最先进的基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
SARC: Split-and-Recombine Networks for Knowledge-Based Recommendation
Utilizing knowledge graphs (KGs) to improve the performance of recommender systems has attracted increasing attention recently. Existing path-based methods rely heavily on manually designed meta-paths, while embedding-based methods focus on incorporating the knowledge graph embeddings (KGE) into recommender systems, but rarely model user-entity interactions, which can be used to enhance the performance of recommendation. To overcome the shortcomings of previous works, we propose SARC, an embedding-based model that utilizes a novel Split-And-ReCombine strategy for knowledge-based recommendation. Firstly, SARC splits the user-item-entity interactions into three 2-way interactions, i.e., the user-item, user-entity and item-entity interactions. Each of the 2-way interactions can be cast as a graph, and we use Graph Neural Networks (GNN) and KGE to model them. Secondly, SARC recombines the representation of users and items learned from the first step to generates recommendation. In order to distinguish the informative part and meaningless part of the representations, we utilize a gated fusion mechanism. The advantage of our SARC model is that through splitting, we can easily handle and make full use of the 2-way interactions, especially the user-entity interactions, and through recombining, we can extract the most useful information for recommendation. Extensive experiments on three real-world datasets demonstrate that SARC outperforms several state-of-the-art baselines.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Monaural Music Source Separation using a ResNet Latent Separator Network Graph-Based Attention Networks for Aspect Level Sentiment Analysis A Multi-channel Neural Network for Imbalanced Emotion Recognition Scaling up Prediction of Psychosis by Natural Language Processing Improving Bandit-Based Recommendations with Spatial Context Reasoning: An Online Evaluation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1