Extending knowledge-based profile matching in the human resources domain

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

Abstract

In the Human Resources domain the accurate matching between job positions and job applicants profiles is crucial for job seekers and recruiters. The use of recruitment taxonomies has proven to be of significant advantage in the area by enabling semantic matching and reasoning. Hence, the development of Knowledge Bases (KB) where curricula vitae and job offers can be uploaded and queried in order to obtain the best matches by both, applicants and recruiters is highly important. We introduce an approach to improve matching of profiles, starting by expressing jobs and applicants profiles by filters representing skills and competencies. Filters are used to calculate the similarity between concepts in the subsumption hierarchy of a KB. This is enhanced by adding weights and aggregates on filters. Moreover, we present an approach to evaluate over-qualification and introduce blow-up operators that transform certain role relations such that matching of filters can be applied.

Cite

CITATION STYLE

APA

Paoletti, A. L., Martinez-Gil, J., & Schewe, K. D. (2015). Extending knowledge-based profile matching in the human resources domain. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9262, pp. 21–35). Springer Verlag. https://doi.org/10.1007/978-3-319-22852-5_3

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