革命性招聘:KNN、加权KNN和SVM - KNN在简历筛选中的比较研究

Rishabh Bathija, Vanshika Bajaj, Chandni Megnani, J. Sawara, Sanjay Mirchandani
{"title":"革命性招聘:KNN、加权KNN和SVM - KNN在简历筛选中的比较研究","authors":"Rishabh Bathija, Vanshika Bajaj, Chandni Megnani, J. Sawara, Sanjay Mirchandani","doi":"10.1109/ICCES57224.2023.10192665","DOIUrl":null,"url":null,"abstract":"In the recruitment process, continued screening assumes a fundamental part in distinguishing qualified contenders for a specific employment opportunity. A huge issue that scouts face is the tedious course of manual screening of resumes. To resolve this issue, this paper proposes the utilization of three ML calculations, in particular K-Nearest Neighbors (KNN), Weighted K-Nearest Neighbors (WKNN), and Support Vector Machine KNN (SVM KNN), for the mechanized screening of resumes. The dataset was manually created consisting of two segments that incorporate various classes like CA, advocate, engineering, and so forth, and the related resume portrayals. The dataset was utilized to prepare and assess the precision of the calculations. The trial concentrates on showing that Weighted KNN outperforms KNN and SVM KNN with an accuracy of 74%. The strategy can empower selection representatives to smooth out their enrollment interaction and distinguish qualified applicants rapidly and cost-effectively.","PeriodicalId":442189,"journal":{"name":"2023 8th International Conference on Communication and Electronics Systems (ICCES)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Revolutionizing Recruitment: A Comparative Study Of KNN, Weighted KNN, and SVM - KNN for Resume Screening\",\"authors\":\"Rishabh Bathija, Vanshika Bajaj, Chandni Megnani, J. Sawara, Sanjay Mirchandani\",\"doi\":\"10.1109/ICCES57224.2023.10192665\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the recruitment process, continued screening assumes a fundamental part in distinguishing qualified contenders for a specific employment opportunity. A huge issue that scouts face is the tedious course of manual screening of resumes. To resolve this issue, this paper proposes the utilization of three ML calculations, in particular K-Nearest Neighbors (KNN), Weighted K-Nearest Neighbors (WKNN), and Support Vector Machine KNN (SVM KNN), for the mechanized screening of resumes. The dataset was manually created consisting of two segments that incorporate various classes like CA, advocate, engineering, and so forth, and the related resume portrayals. The dataset was utilized to prepare and assess the precision of the calculations. The trial concentrates on showing that Weighted KNN outperforms KNN and SVM KNN with an accuracy of 74%. The strategy can empower selection representatives to smooth out their enrollment interaction and distinguish qualified applicants rapidly and cost-effectively.\",\"PeriodicalId\":442189,\"journal\":{\"name\":\"2023 8th International Conference on Communication and Electronics Systems (ICCES)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 8th International Conference on Communication and Electronics Systems (ICCES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCES57224.2023.10192665\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 8th International Conference on Communication and Electronics Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES57224.2023.10192665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在招聘过程中,持续的筛选是区分合格的竞争者以获得特定就业机会的基本部分。猎头面临的一个大问题是手动筛选简历的繁琐过程。为了解决这一问题,本文提出利用三种ML计算方法,即k近邻(KNN)、加权k近邻(WKNN)和支持向量机KNN (SVM KNN)来进行简历的机械化筛选。数据集是手动创建的,由两个部分组成,其中包含各种类别,如CA、倡导者、工程等,以及相关的简历描述。该数据集用于准备和评估计算的精度。实验集中在表明加权KNN优于KNN和SVM KNN,准确率为74%。该策略可以使选拔代表顺利地完成他们的招生互动,并迅速和经济地区分合格的申请人。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Revolutionizing Recruitment: A Comparative Study Of KNN, Weighted KNN, and SVM - KNN for Resume Screening
In the recruitment process, continued screening assumes a fundamental part in distinguishing qualified contenders for a specific employment opportunity. A huge issue that scouts face is the tedious course of manual screening of resumes. To resolve this issue, this paper proposes the utilization of three ML calculations, in particular K-Nearest Neighbors (KNN), Weighted K-Nearest Neighbors (WKNN), and Support Vector Machine KNN (SVM KNN), for the mechanized screening of resumes. The dataset was manually created consisting of two segments that incorporate various classes like CA, advocate, engineering, and so forth, and the related resume portrayals. The dataset was utilized to prepare and assess the precision of the calculations. The trial concentrates on showing that Weighted KNN outperforms KNN and SVM KNN with an accuracy of 74%. The strategy can empower selection representatives to smooth out their enrollment interaction and distinguish qualified applicants rapidly and cost-effectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信