Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/32657
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAjjam, M-H-
dc.contributor.authorAl-Raweshidy, HS-
dc.date.accessioned2026-01-15T19:10:38Z-
dc.date.available2026-01-15T19:10:38Z-
dc.date.issued2025-09-25-
dc.identifierORCiD: Mohammed-Hassan Ajjam https://orcid.org/0009-0006-1722-6796-
dc.identifierORCiD: Hamed S. Al-Raweshidy https://orcid.org/0000-0002-3702-8192-
dc.identifierArticle number: 122728-
dc.identifier.citationAjjam, M.-H. and Al-Raweshidy, H.S. (2025) 'AI-driven semantic similarity-based job matching framework for recruitment systems', Information Sciences, 724, 122728, pp. 1 - 17. doi: 10.1016/j.ins.2025.122728.en_US
dc.identifier.issn0020-0255-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/32657-
dc.descriptionData availability: I have shared the data links in the references.en_US
dc.descriptionSupplementary data are available online at: https://www.sciencedirect.com/science/article/pii/S0020025525008643?via%3Dihub#s0155 .-
dc.description.abstractThis paper presents a real-time online recruitment application that integrates semantic similarity and artificial intelligence (AI) to improve job-candidate matching. It addresses the growing volume of job applications and the limitations of traditional keyword-based systems, which often fail to capture contextual meaning and complex semantic relationships in job-candidate alignment. The proposed system leverages natural language processing (NLP) techniques, specifically TF-IDF vectorization, cosine similarity scoring, and domain-specific keyword weighting, to interpret conceptual relevance between resumes and job descriptions, enabling more accurate and inclusive recruitment outcomes. This research developed the system in Python and evaluated it using simulated and real-world recruitment datasets. Experimental results show that the semantic model consistently outperforms keyword-based matching across diverse job domains. For instance, in simulated tests, similarity scores reached 0.74 in the Software Engineer domain, compared to just 0.35 using keyword-based methods. Real-world evaluations further confirmed the model’s effectiveness, with semantic scores of 0.83, 0.76, and 0.74 for the Hadoop, Data Science, and PMP domains, respectively. In contrast, the corresponding keyword-based scores remained below 0.17. Additionally, the system performs well in aligning generalist and specialist profiles, achieving a score of 0.88 for Data analysis roles. These findings validate the system’s robustness, scalability, and ability to interpret varied terminology across job sectors. The research presents a scalable, AI-driven framework that supports context-aware, fair, and accurate job matching, significantly advancing intelligent recruitment technology.en_US
dc.format.extent1 - 17-
dc.format.mediumPrint-Electronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherElsevieren_US
dc.rightsCreative Commons Attribution 4.0 International-
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/-
dc.subjectsemantic similarityen_US
dc.subjectNLPAI-driven recruitment efficiencyen_US
dc.subjectMLen_US
dc.subjectIntelligent recruitment systemsen_US
dc.subjectcontext-aware matchingen_US
dc.titleAI-driven semantic similarity-based job matching framework for recruitment systemsen_US
dc.typeArticleen_US
dc.date.dateAccepted2025-09-23-
dc.identifier.doihttps://doi.org/10.1016/j.ins.2025.122728-
dc.relation.isPartOfInformation Sciences-
pubs.publication-statusPublished-
pubs.volume724-
dc.identifier.eissn1872-6291-
dc.rights.licensehttps://creativecommons.org/licenses/by/4.0/legalcode.en-
dcterms.dateAccepted2025-09-23-
dc.rights.holderThe Authors-
dc.contributor.orcidAjjam, Mohammed-Hassan [0009-0006-1722-6796]-
dc.contributor.orcidAl-Raweshidy, Hamed S. [0000-0002-3702-8192]-
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2025 The Authors. Published by Elsevier Inc. This is an Open Access article under a Creative Commons license (https://creativecommons.org/licenses/by/4.0/).3.33 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons