Leveraging Knowledge Graphs for Orphan Entity Allocation in Resume Processing

Aagam Bakliwal, Shubham Manish Gandhi, Yashodhara Haribhakta
10/21/2023
cs.CL

No confident code implementation found for this paper.

Abstract

Significant challenges are posed in talent acquisition and recruitment by processing and analyzing unstructured data, particularly resumes. This research presents a novel approach for orphan entity allocation in resume processing using knowledge graphs. Techniques of association mining, concept extraction, external knowledge linking, named entity recognition, and knowledge graph construction are integrated into our pipeline. By leveraging these techniques, the aim is to automate and enhance the efficiency of the job screening process by successfully bucketing orphan entities within resumes. This allows for more effective matching between candidates and job positions, streamlining the resume screening process, and enhancing the accuracy of candidate-job matching. The approach's exceptional effectiveness and resilience are highlighted through extensive experimentation and evaluation, ensuring that alternative measures can be relied upon for seamless processing and orphan entity allocation in case of any component failure. The capabilities of knowledge graphs in generating valuable insights through intelligent information extraction and representation, specifically in the domain of categorizing orphan entities, are highlighted by the results of our research.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bakliwal2023leveraging,
  title  = {Leveraging Knowledge Graphs for Orphan Entity Allocation in Resume Processing},
  author = {Aagam Bakliwal and Shubham Manish Gandhi and Yashodhara Haribhakta},
  year   = {2023},
  eprint = {2310.14093},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.14093v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.14093.svg)](https://codeofpaper.com/paper/2310.14093)

Discussion