基于知识图谱相关路径分析的学术论文推荐

Xiao Wang, Hanchuan Xu, Wenjie Tan, Zhongjie Wang, Xiaofei Xu
{"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}
引用次数: 2

摘要

从大量的学术论文中为科研人员推荐有用的、有趣的学术论文是提高科研效率的主要途径。传统的协同过滤或基于内容的推荐方法缺乏融合良好的知识图谱,存在冷启动、解释差等方法瓶颈。基于知识感知路径循环网络(KPRN),提出了一种结合用户偏好和知识图路径信息的学术论文推荐方法。首先,提出了一种延迟扩展双向宽度优先搜索路径算法,以较低的时间复杂度寻找知识图中两个节点之间的路径;然后,根据用户的历史纸张操作生成用户偏好向量。最后,利用LSTM循环神经网络模型提取多路径信息,并结合用户偏好得到推荐论文列表。实验结果表明了该方法的有效性和良好的可解释性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信