{"title":"基于知识图谱相关路径分析的学术论文推荐","authors":"Xiao Wang, Hanchuan Xu, Wenjie Tan, Zhongjie Wang, Xiaofei Xu","doi":"10.1109/ICSS50103.2020.00014","DOIUrl":null,"url":null,"abstract":"Recommending helpful and interesting scholarly papers for researchers from a large number of scholarly papers is the main way to improve research efficiency. Traditional collaborative filtering or content-based recommendation methods do not have a better-fused knowledge graph and have method bottlenecks such as cold start and poor interpretation. Based on the knowledge-aware path recurrent network (KPRN), this paper proposes a method for recommending scholarly papers that combines user preferences and knowledge graph path information. Firstly, a delayed extension bi-directional breadth-first search path algorithm is proposed to find the path between two nodes in the knowledge graph with low time complexity. Then, the user preference vector is generated by the user's historical paper operation. Finally, the LSTM cyclic neural network model is used to extract the information of multiple paths and combine it with user preferences to obtain the list of recommended papers. The experimental results show the validity and good interpretability of this method.","PeriodicalId":292795,"journal":{"name":"2020 International Conference on Service Science (ICSS)","volume":"272 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Scholarly Paper Recommendation via Related Path Analysis in Knowledge Graph\",\"authors\":\"Xiao Wang, Hanchuan Xu, Wenjie Tan, Zhongjie Wang, Xiaofei Xu\",\"doi\":\"10.1109/ICSS50103.2020.00014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recommending helpful and interesting scholarly papers for researchers from a large number of scholarly papers is the main way to improve research efficiency. Traditional collaborative filtering or content-based recommendation methods do not have a better-fused knowledge graph and have method bottlenecks such as cold start and poor interpretation. Based on the knowledge-aware path recurrent network (KPRN), this paper proposes a method for recommending scholarly papers that combines user preferences and knowledge graph path information. Firstly, a delayed extension bi-directional breadth-first search path algorithm is proposed to find the path between two nodes in the knowledge graph with low time complexity. Then, the user preference vector is generated by the user's historical paper operation. Finally, the LSTM cyclic neural network model is used to extract the information of multiple paths and combine it with user preferences to obtain the list of recommended papers. The experimental results show the validity and good interpretability of this method.\",\"PeriodicalId\":292795,\"journal\":{\"name\":\"2020 International Conference on Service Science (ICSS)\",\"volume\":\"272 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Service Science (ICSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSS50103.2020.00014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Service Science (ICSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSS50103.2020.00014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scholarly Paper Recommendation via Related Path Analysis in Knowledge Graph
Recommending helpful and interesting scholarly papers for researchers from a large number of scholarly papers is the main way to improve research efficiency. Traditional collaborative filtering or content-based recommendation methods do not have a better-fused knowledge graph and have method bottlenecks such as cold start and poor interpretation. Based on the knowledge-aware path recurrent network (KPRN), this paper proposes a method for recommending scholarly papers that combines user preferences and knowledge graph path information. Firstly, a delayed extension bi-directional breadth-first search path algorithm is proposed to find the path between two nodes in the knowledge graph with low time complexity. Then, the user preference vector is generated by the user's historical paper operation. Finally, the LSTM cyclic neural network model is used to extract the information of multiple paths and combine it with user preferences to obtain the list of recommended papers. The experimental results show the validity and good interpretability of this method.