Saeed Ur Rehman Bhatti, Shujaat Hussain, Kifayat-Ullah Khan
{"title":"电子招聘系统中一种鲁棒的候选人剪枝和特征权值生成算法","authors":"Saeed Ur Rehman Bhatti, Shujaat Hussain, Kifayat-Ullah Khan","doi":"10.1109/INMIC56986.2022.9972934","DOIUrl":null,"url":null,"abstract":"Globalization, enhanced networking, and contemporary communication systems have resulted in a substantial increase in the number of resumes created. Processing this massive chunk manually is time-consuming. Multiple Criteria Decision Making (MCDM) techniques, such as “Analytic Hierarchy Process” (AHP), “The Technique for Order of Preference by Similarity to Ideal Solution” (TOPSIS), “VlseKriterijumska Optimizacija I Kompromisno Resenje” (VIKOR), and their state-of-the-art optimized variants, SlashRank, consider multiple factors and then rank the results accordingly to streamline the process. These algorithms primarily focus on reducing computational complexity, however, they ignore automated feature importance since they require manual features weights as an explicit input. In the end, this leads to a biased result and a decentralized method of hiring candidates. Our research addresses the human intervention observed in previously identified techniques and proposes a technique that automates candidate pruning, manual feature priority input, and generates new feature importance based on user feedback. Our approach can be decomposed into automated candidate pruning for the highest priority feature, candidate selection feedback, and trend-based feature weight generation to replicate actual recruitment feature priority fluctuations. Our algorithm demonstrates promising results in minimizing human biases and generating a dynamic trend of feature importance over time.","PeriodicalId":404424,"journal":{"name":"2022 24th International Multitopic Conference (INMIC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Robust Algorithm for Candidate Pruning and Feature Weight Generation in E-Recruitment System\",\"authors\":\"Saeed Ur Rehman Bhatti, Shujaat Hussain, Kifayat-Ullah Khan\",\"doi\":\"10.1109/INMIC56986.2022.9972934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Globalization, enhanced networking, and contemporary communication systems have resulted in a substantial increase in the number of resumes created. Processing this massive chunk manually is time-consuming. Multiple Criteria Decision Making (MCDM) techniques, such as “Analytic Hierarchy Process” (AHP), “The Technique for Order of Preference by Similarity to Ideal Solution” (TOPSIS), “VlseKriterijumska Optimizacija I Kompromisno Resenje” (VIKOR), and their state-of-the-art optimized variants, SlashRank, consider multiple factors and then rank the results accordingly to streamline the process. These algorithms primarily focus on reducing computational complexity, however, they ignore automated feature importance since they require manual features weights as an explicit input. In the end, this leads to a biased result and a decentralized method of hiring candidates. Our research addresses the human intervention observed in previously identified techniques and proposes a technique that automates candidate pruning, manual feature priority input, and generates new feature importance based on user feedback. Our approach can be decomposed into automated candidate pruning for the highest priority feature, candidate selection feedback, and trend-based feature weight generation to replicate actual recruitment feature priority fluctuations. Our algorithm demonstrates promising results in minimizing human biases and generating a dynamic trend of feature importance over time.\",\"PeriodicalId\":404424,\"journal\":{\"name\":\"2022 24th International Multitopic Conference (INMIC)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 24th International Multitopic Conference (INMIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INMIC56986.2022.9972934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Multitopic Conference (INMIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC56986.2022.9972934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
全球化、增强的网络和现代通信系统导致了简历数量的大幅增加。手动处理这个庞大的块非常耗时。多标准决策(MCDM)技术,如“层次分析法”(AHP),“理想解决方案相似性偏好排序技术”(TOPSIS),“VlseKriterijumska Optimizacija I Kompromisno Resenje”(VIKOR),以及它们最先进的优化变体SlashRank,考虑多个因素,然后相应地对结果进行排序,以简化过程。这些算法主要关注于降低计算复杂性,然而,它们忽略了自动特征的重要性,因为它们需要手动特征权重作为显式输入。最终,这会导致一个有偏见的结果和一个分散的招聘候选人的方法。我们的研究解决了在先前确定的技术中观察到的人为干预问题,并提出了一种技术,该技术可以自动修剪候选特征,手动输入特征优先级,并根据用户反馈生成新的特征重要性。我们的方法可以分解为最高优先级特征的自动候选修剪,候选人选择反馈和基于趋势的特征权重生成,以复制实际招聘特征优先级波动。我们的算法在最小化人类偏见和生成特征重要性随时间的动态趋势方面显示了有希望的结果。
A Robust Algorithm for Candidate Pruning and Feature Weight Generation in E-Recruitment System
Globalization, enhanced networking, and contemporary communication systems have resulted in a substantial increase in the number of resumes created. Processing this massive chunk manually is time-consuming. Multiple Criteria Decision Making (MCDM) techniques, such as “Analytic Hierarchy Process” (AHP), “The Technique for Order of Preference by Similarity to Ideal Solution” (TOPSIS), “VlseKriterijumska Optimizacija I Kompromisno Resenje” (VIKOR), and their state-of-the-art optimized variants, SlashRank, consider multiple factors and then rank the results accordingly to streamline the process. These algorithms primarily focus on reducing computational complexity, however, they ignore automated feature importance since they require manual features weights as an explicit input. In the end, this leads to a biased result and a decentralized method of hiring candidates. Our research addresses the human intervention observed in previously identified techniques and proposes a technique that automates candidate pruning, manual feature priority input, and generates new feature importance based on user feedback. Our approach can be decomposed into automated candidate pruning for the highest priority feature, candidate selection feedback, and trend-based feature weight generation to replicate actual recruitment feature priority fluctuations. Our algorithm demonstrates promising results in minimizing human biases and generating a dynamic trend of feature importance over time.