Multi-feature and multi-relationship talent discovery algorithm based on knowledge graph

Chen Yuanyi; Wang Huamin; Su Zeyin; Li Ruizhu

doi:10.1117/12.2653416

8 December 2022 Multi-feature and multi-relationship talent discovery algorithm based on knowledge graph

Chen Yuanyi, Wang Huamin, Su Zeyin, Li Ruizhu

Proceedings Volume 12474, Second International Symposium on Computer Technology and Information Science (ISCTIS 2022); 124740U (2022) https://doi.org/10.1117/12.2653416
Event: Second International Symposium on Computer Technology and Information Science (ISCTIS 2022), 2022, Guilin, China

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.

Citation Download Citation

Chen Yuanyi, Wang Huamin, Su Zeyin, and Li Ruizhu "Multi-feature and multi-relationship talent discovery algorithm based on knowledge graph", Proc. SPIE 12474, Second International Symposium on Computer Technology and Information Science (ISCTIS 2022), 124740U (8 December 2022); https://doi.org/10.1117/12.2653416

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available