{"title":"基于知识图谱的多视图用户偏好学习推荐","authors":"Yiming Zhang, Yitong Pang, Zhihua Wei","doi":"10.1109/icicse55337.2022.9828877","DOIUrl":null,"url":null,"abstract":"To learn more comprehensive user preference, existing works in recommendation propose to utilize side information, like Knowledge Graph (KG). However, the user representation can come from many views, including ID attributes of the user, collaborative signals of interaction history, and fine-grained preferences in KG, which has not been well studied in previous works. To address the limitation, in this work, we propose the Multi-view User Preference Learning with knowledge graph (MUPL) for recommendation to address the limitation. Specifically, we propose to employ Gate Recurrent Unit (GRU) to learn the user latent collaborative feature from interaction sequence. Besides, we design a Knowledge Graph Attention Network (KGANet) to capture user fine-grained preference for the entities related with the items. Then we fusion user ID attributes, the collaborative feature and fine-grained preference for entities into the user final representation. Similarly, we employ an item encoder to get the item final representation. Finally, a predictor is proposed for recommendation. Extensive experiments on three public datasets show that our model outperforms the state-of-the-art (SOTA) methods on effectiveness.","PeriodicalId":177985,"journal":{"name":"2022 IEEE 2nd International Conference on Information Communication and Software Engineering (ICICSE)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-view User Preference Learning with Knowledge Graph for Recommendation\",\"authors\":\"Yiming Zhang, Yitong Pang, Zhihua Wei\",\"doi\":\"10.1109/icicse55337.2022.9828877\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To learn more comprehensive user preference, existing works in recommendation propose to utilize side information, like Knowledge Graph (KG). However, the user representation can come from many views, including ID attributes of the user, collaborative signals of interaction history, and fine-grained preferences in KG, which has not been well studied in previous works. To address the limitation, in this work, we propose the Multi-view User Preference Learning with knowledge graph (MUPL) for recommendation to address the limitation. Specifically, we propose to employ Gate Recurrent Unit (GRU) to learn the user latent collaborative feature from interaction sequence. Besides, we design a Knowledge Graph Attention Network (KGANet) to capture user fine-grained preference for the entities related with the items. Then we fusion user ID attributes, the collaborative feature and fine-grained preference for entities into the user final representation. Similarly, we employ an item encoder to get the item final representation. Finally, a predictor is proposed for recommendation. Extensive experiments on three public datasets show that our model outperforms the state-of-the-art (SOTA) methods on effectiveness.\",\"PeriodicalId\":177985,\"journal\":{\"name\":\"2022 IEEE 2nd International Conference on Information Communication and Software Engineering (ICICSE)\",\"volume\":\"311 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 2nd International Conference on Information Communication and Software Engineering (ICICSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icicse55337.2022.9828877\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 2nd International Conference on Information Communication and Software Engineering (ICICSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icicse55337.2022.9828877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
为了更全面地了解用户偏好,现有的推荐工作建议利用侧信息,如知识图(Knowledge Graph, KG)。然而,用户表示可以来自许多视图,包括用户的ID属性、交互历史的协作信号和KG中的细粒度偏好,这些在以前的工作中没有得到很好的研究。为了解决这一限制,在本工作中,我们提出了基于知识图的多视图用户偏好学习(Multi-view User Preference Learning with knowledge graph, MUPL)作为推荐来解决这一限制。具体来说,我们提出使用门循环单元(GRU)从交互序列中学习用户潜在的协同特征。此外,我们设计了一个知识图注意力网络(KGANet)来捕获用户对与项目相关的实体的细粒度偏好。然后,我们将用户ID属性、协作特征和实体的细粒度偏好融合到用户最终表示中。类似地,我们使用项目编码器来获得项目的最终表示。最后,提出了一个预测器作为推荐。在三个公共数据集上进行的大量实验表明,我们的模型在有效性上优于最先进的(SOTA)方法。
Multi-view User Preference Learning with Knowledge Graph for Recommendation
To learn more comprehensive user preference, existing works in recommendation propose to utilize side information, like Knowledge Graph (KG). However, the user representation can come from many views, including ID attributes of the user, collaborative signals of interaction history, and fine-grained preferences in KG, which has not been well studied in previous works. To address the limitation, in this work, we propose the Multi-view User Preference Learning with knowledge graph (MUPL) for recommendation to address the limitation. Specifically, we propose to employ Gate Recurrent Unit (GRU) to learn the user latent collaborative feature from interaction sequence. Besides, we design a Knowledge Graph Attention Network (KGANet) to capture user fine-grained preference for the entities related with the items. Then we fusion user ID attributes, the collaborative feature and fine-grained preference for entities into the user final representation. Similarly, we employ an item encoder to get the item final representation. Finally, a predictor is proposed for recommendation. Extensive experiments on three public datasets show that our model outperforms the state-of-the-art (SOTA) methods on effectiveness.