Tao Li, Hao Li, Sheng Zhong, Yan Kang, Yachuan Zhang, Rongjing Bu, Yang Hu
{"title":"推荐系统的知识图表示推理","authors":"Tao Li, Hao Li, Sheng Zhong, Yan Kang, Yachuan Zhang, Rongjing Bu, Yang Hu","doi":"10.32604/jnm.2020.09767","DOIUrl":null,"url":null,"abstract":": In view of the low interpretability of existing collaborative filtering recommendation algorithms and the difficulty of extracting information from content-based recommendation algorithms, we propose an efficient KGRS model. KGRS first obtains reasoning paths of knowledge graph and embeds the entities of paths into vectors based on knowledge representation learning TransD algorithm, then uses LSTM and soft attention mechanism to capture the semantic of each path reasoning, then uses convolution operation and pooling operation to distinguish the importance of different paths reasoning. Finally, through the full connection layer and sigmoid function to get the prediction ratings, and the items are sorted according to the prediction ratings to get the user’s recommendation list. KGRS is tested on the movielens-100k dataset. Compared with the related representative algorithm, including the state-of-the-art interpretable recommendation models RKGE and RippleNet, the experimental results show that KGRS has good recommendation interpretation and higher recommendation accuracy.","PeriodicalId":69198,"journal":{"name":"新媒体杂志(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Knowledge Graph Representation Reasoning for Recommendation System\",\"authors\":\"Tao Li, Hao Li, Sheng Zhong, Yan Kang, Yachuan Zhang, Rongjing Bu, Yang Hu\",\"doi\":\"10.32604/jnm.2020.09767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": In view of the low interpretability of existing collaborative filtering recommendation algorithms and the difficulty of extracting information from content-based recommendation algorithms, we propose an efficient KGRS model. KGRS first obtains reasoning paths of knowledge graph and embeds the entities of paths into vectors based on knowledge representation learning TransD algorithm, then uses LSTM and soft attention mechanism to capture the semantic of each path reasoning, then uses convolution operation and pooling operation to distinguish the importance of different paths reasoning. Finally, through the full connection layer and sigmoid function to get the prediction ratings, and the items are sorted according to the prediction ratings to get the user’s recommendation list. KGRS is tested on the movielens-100k dataset. Compared with the related representative algorithm, including the state-of-the-art interpretable recommendation models RKGE and RippleNet, the experimental results show that KGRS has good recommendation interpretation and higher recommendation accuracy.\",\"PeriodicalId\":69198,\"journal\":{\"name\":\"新媒体杂志(英文)\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"新媒体杂志(英文)\",\"FirstCategoryId\":\"1092\",\"ListUrlMain\":\"https://doi.org/10.32604/jnm.2020.09767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"新媒体杂志(英文)","FirstCategoryId":"1092","ListUrlMain":"https://doi.org/10.32604/jnm.2020.09767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Knowledge Graph Representation Reasoning for Recommendation System
: In view of the low interpretability of existing collaborative filtering recommendation algorithms and the difficulty of extracting information from content-based recommendation algorithms, we propose an efficient KGRS model. KGRS first obtains reasoning paths of knowledge graph and embeds the entities of paths into vectors based on knowledge representation learning TransD algorithm, then uses LSTM and soft attention mechanism to capture the semantic of each path reasoning, then uses convolution operation and pooling operation to distinguish the importance of different paths reasoning. Finally, through the full connection layer and sigmoid function to get the prediction ratings, and the items are sorted according to the prediction ratings to get the user’s recommendation list. KGRS is tested on the movielens-100k dataset. Compared with the related representative algorithm, including the state-of-the-art interpretable recommendation models RKGE and RippleNet, the experimental results show that KGRS has good recommendation interpretation and higher recommendation accuracy.