{"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}
引用次数: 1
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.