基于知识图谱的多特征多关系人才发现算法

Chen Yuanyi, Wang Huamin, Su Zeyin, Li Ruizhu
{"title":"基于知识图谱的多特征多关系人才发现算法","authors":"Chen Yuanyi, Wang Huamin, Su Zeyin, Li Ruizhu","doi":"10.1117/12.2653416","DOIUrl":null,"url":null,"abstract":"In this era of information explosion, we need to query through scholar website, talent website or major recruitment websites to find the required talent information. However, there are problems of easy matching failure, low correlation, high maintenance cost, complicated steps and lack of information. Considering with the current research direction and its short comings, this paper proposes a multi-feature and multi-relationship talent discovery algorithm based on knowledge graph (TDKG). Firstly, the talent graph is constructed based on talent dataset, then the needs of user are analyzed by natural language processing, and finally the multi-feature and multi-relationship search is realized by combining the talent graph. By crawling the real talent data on the post graduate enrollment information website, the talent graph and the talent discovery system is constructed for verification. The experiment shows that this algorithm can precisely identify the needs of users and return the talent information required by users. Compared with the existing talent search methods, it has more pertinence, richer and more perfect functions.","PeriodicalId":32903,"journal":{"name":"JITeCS Journal of Information Technology and Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-feature and multi-relationship talent discovery algorithm based on knowledge graph\",\"authors\":\"Chen Yuanyi, Wang Huamin, Su Zeyin, Li Ruizhu\",\"doi\":\"10.1117/12.2653416\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this era of information explosion, we need to query through scholar website, talent website or major recruitment websites to find the required talent information. However, there are problems of easy matching failure, low correlation, high maintenance cost, complicated steps and lack of information. Considering with the current research direction and its short comings, this paper proposes a multi-feature and multi-relationship talent discovery algorithm based on knowledge graph (TDKG). Firstly, the talent graph is constructed based on talent dataset, then the needs of user are analyzed by natural language processing, and finally the multi-feature and multi-relationship search is realized by combining the talent graph. By crawling the real talent data on the post graduate enrollment information website, the talent graph and the talent discovery system is constructed for verification. The experiment shows that this algorithm can precisely identify the needs of users and return the talent information required by users. Compared with the existing talent search methods, it has more pertinence, richer and more perfect functions.\",\"PeriodicalId\":32903,\"journal\":{\"name\":\"JITeCS Journal of Information Technology and Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JITeCS Journal of Information Technology and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2653416\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JITeCS Journal of Information Technology and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2653416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这个信息爆炸的时代,我们需要通过学者网站、人才网站或各大招聘网站进行查询,找到所需的人才信息。但存在容易匹配失败、相关性低、维护成本高、步骤复杂、信息缺乏等问题。针对目前的研究方向和存在的不足,提出了一种基于知识图的多特征、多关系的人才发现算法。首先基于人才数据集构建人才图谱,然后通过自然语言处理对用户需求进行分析,最后结合人才图谱实现多特征、多关系的搜索。通过抓取研究生招生信息网站上的真实人才数据,构建人才图谱和人才发现系统进行验证。实验表明,该算法能够准确识别用户需求,并返回用户所需的人才信息。与现有的人才搜索方法相比,具有更强的针对性、更丰富、更完善的功能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-feature and multi-relationship talent discovery algorithm based on knowledge graph
In this era of information explosion, we need to query through scholar website, talent website or major recruitment websites to find the required talent information. However, there are problems of easy matching failure, low correlation, high maintenance cost, complicated steps and lack of information. Considering with the current research direction and its short comings, this paper proposes a multi-feature and multi-relationship talent discovery algorithm based on knowledge graph (TDKG). Firstly, the talent graph is constructed based on talent dataset, then the needs of user are analyzed by natural language processing, and finally the multi-feature and multi-relationship search is realized by combining the talent graph. By crawling the real talent data on the post graduate enrollment information website, the talent graph and the talent discovery system is constructed for verification. The experiment shows that this algorithm can precisely identify the needs of users and return the talent information required by users. Compared with the existing talent search methods, it has more pertinence, richer and more perfect functions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
12
审稿时长
20 weeks
×
引用
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学术官方微信