DRL-based Multi-Hop Relational Reasoning for Personnel Management Knowledge Graph

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the personnel management knowledge graph, the absence of relations will lead to an incomplete knowledge graph, which affects downstream applications. While existing approaches can handle relational reasoning tasks, many neglect reasoning efficiency and implicit semantic information in multi-hop relational paths. Therefore, we proposed a multi-hop relational reasoning model based on deep reinforcement learning to reason out paths with implicit semantic information. We optimize the proximal policy optimization algorithm to implement reasoning. The irrelevant actions masking scheme makes the reasoning more efficient. And the reward shaping make the reasoned multi-hop relational paths semantically interpretable. We construct a formal dataset containing a large number of triples to represent the personnel management knowledge graph. By comparing the experimental results on metrics about MAP, MRR, Hits@k, and frequency of paths with other baselines, our proposed model is more advantageous in the personnel management knowledge graph. In addition, experimental results on the dataset NELL-995 show that our proposed model's performance can compare to the mainstream methods.

Cite

CITATION STYLE

APA

Liu, S., Li, K., Liu, X., & Yu, K. (2023). DRL-based Multi-Hop Relational Reasoning for Personnel Management Knowledge Graph. In 2023 4th International Conference on Computer Engineering and Application, ICCEA 2023 (pp. 633–638). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ICCEA58433.2023.10135370

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free