Lazy Learned Screening for Efficient Recruitment

被引:2
|
作者
Espenakk, Erik [1 ]
Knalstad, Magnus Johan [1 ]
Kofod-Petersen, Anders [1 ,2 ]
机构
[1] Norwegian Univ Sci & Technol, Dept Comp Sci, N-7491 Trondheim, Norway
[2] Alexandra Inst, Njalsgade 76,3 Sal, DK-2300 Copenhagen S, Denmark
关键词
Candidate ranking; Human resources; Recruitment; SYSTEM; RANKING; IMPROVE; FIELD;
D O I
10.1007/978-3-030-29249-2_5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The transition from traditional paper based systems for recruitment to the internet has resulted in companies in getting a lot more applications. A majority of these applications are often unstructured documents sent over email. This results in a lot of work sorting through the applicants. Due to this, a number of systems have been implemented in an effort to make the screening phase more efficient. The main problems consist of extracting information from resumes and ranking the candidates for positions based on their relevance. We develop a system that can learn how to rank candidates for a position based on knowledge obtained from earlier screening phases. This Candidate Ranking System (CRS) is based on Case-based Reasoning, combined with semantic data models. The systems performance is evaluated in conjunction with a large international Job company and a software company in an actual recruitment process.
引用
收藏
页码:64 / 78
页数:15
相关论文
共 50 条
  • [1] EFFICIENT COMPILATION OF LAZY EVALUATION
    JOHNSSON, T
    SIGPLAN NOTICES, 1984, 19 (06): : 58 - 69
  • [2] Efficient and Reusable Lazy Sampling
    Sanca, Viktor
    Chrysogelos, Periklis
    Ailamaki, Anastasia
    SIGMOD RECORD, 2024, 53 (01) : 33 - 42
  • [3] Efficient compilation of lazy evaluation
    Johnsson, T
    ACM SIGPLAN NOTICES, 2004, 39 (04) : 127 - 138
  • [4] Fast and efficient commits for Lazy-Lazy hardware transactional memory
    Gaona, Epifanio
    Abelln, Jose L.
    Acacio, Manuel E.
    JOURNAL OF SUPERCOMPUTING, 2015, 71 (12): : 4305 - 4326
  • [5] Fast and efficient commits for Lazy-Lazy hardware transactional memory
    Epifanio Gaona
    José L. Abellán
    Manuel E. Acacio
    The Journal of Supercomputing, 2015, 71 : 4305 - 4326
  • [6] Efficient implementation of lazy suffix trees
    Giegerich, R
    Kurtz, S
    Stoye, J
    SOFTWARE-PRACTICE & EXPERIENCE, 2003, 33 (11): : 1035 - 1049
  • [7] Efficient implementation of lazy suffix trees
    Giegerich, R
    Kurtz, S
    Stoye, J
    ALGORITHM ENGINEERING, 1999, 1668 : 30 - 42
  • [8] SCREENING AND RECRUITMENT
    PETROVITCH, H
    BYINGTON, R
    BAILEY, G
    BORHANI, P
    CARMODY, S
    GOODWIN, L
    HARRINGTON, J
    JOHNSON, HA
    JOHNSON, P
    JONES, M
    LEVIN, J
    SUGARS, C
    PROBSTFIELD, JL
    HYPERTENSION, 1991, 17 (03) : 16 - 23
  • [9] GENERATING EFFICIENT CODE FOR LAZY FUNCTIONAL LANGUAGES
    SMETSERS, S
    NOCKER, E
    VANGRONINGEN, J
    PLASMEIJER, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 523 : 592 - 617
  • [10] Efficient Intensional Implementation for Lazy Functional Languages
    Charalambidis, Angelos
    Grivas, Athanasios
    Papaspyrou, Nikolaos S.
    Rondogiannis, Panos
    MATHEMATICS IN COMPUTER SCIENCE, 2008, 2 (01) : 123 - 141