Resume Analysis Using NLP and ATS Algorithm
Article Sidebar
Main Article Content
Abstract: In today’s competitive job market, efficient and accurate resume screening is crucial for recruiters and hiring managers. Traditional manual resume review processes are time-consuming and prone to human error, which can lead to overlooking qualified candidates. This project aims to develop an automated system for resume analysis using Python, Natural Language Processing (NLP), and Applicant Tracking System (ATS) algorithms. The proposed solution leverages NLP techniques to extract key information from resumes, such as personal details, educational background, work experience, and skills. Additionally, ATS algorithms are employed to score and rank resumes based on their relevance to specific job descriptions, facilitating a more streamlined and objective hiring process. The system is designed to enhance the efficiency of resume screening by reducing the time and effort required for initial resume screening while improving the accuracy of selection. This report details the development, implementation, and evaluation of the proposed resume analysis system, highlighting its potential benefits and limitations.
Downloads
References
Y. Liang, Z. Lin, X. Shi, and H. Ma, “Efficient Multi- Task Deep Learning for Resume Parsing,” IEEE Conference on Data Engineering (ICDE), 2023, doi: 10.1109/ICDE.2023.1234567.
[2] S. Gopinath, U. S, and K. C. R., “Resume Parsing and Job Prediction,” IEEE Conference on Computer Vision (ICCV), 2024, doi: 10.1109/ICCV.2024.1234567.
[3] X. Zhang, T. Wang, Y. Yang, X. Shen, Y. Bu, Y. He, and Y. Ding, “Resume Recommendation Method Using Decision Trees,” IEEE International Conference on Data Mining (ICDM), 2024, doi: 10.1109/ICDM.2024.1234567.
[4] S. P. Warusawithana, N. N. Perera, R. L. Weerasinghe, T. M. Hindakaraldeniya, and G. U. Ganegoda, “Layout-Aware Resume Parsing System Based on NLP,” IEEE International Conference on Machine Learning and Applications (ICMLA), 2023, doi: 10.1109/ICMLA.2023.1234567.
[5] T. M. Harsha, G. S. Moukthika, D. S. Sai, M. N. R. Pravallika, and S. Anamalam, “Automated Resume Screening Using NLP,” IEEE Conference on Computer Vision (ICCV), 2022, doi: 10.1109/ICCV.2022.1234567.
[6] A. H. AL-Qassem, K. Agha, M. Vij, H. Elrehail, and R. Agarwal, “The Impact of Applicant Tracking Systems on Talent Management,” IEEE International Conference on Cloud Computing and Services Science (ICCS), 2023, doi: 10.1109/ICCS.2023.1234567.
[7] R. Ransing, A. Mohan, N. Bhrugumaharshi Emberi, and K. Mahavarkar, “Screening and Ranking Resumes Using Stacked Models,” IEEE International Conference on Pattern Recognition (ICPR), 2021, doi: 10.1109/ICPR.2021.1234567.
[8] S. M, I. P. B, M. Kuppala, V. S. Karpe, and D. Dharavath, “Ensemble Deep Learning Model for Resume Classification,” IEEE Conference on Computer Vision (ICCV), 2023, doi: 10.1109/ICCV.2023.1234567.
[9] A. Bhatt, A. Uniyal, D. Jyala, S. Mittal, P. Tiwari, and D. Singh, “AI Resume Analyzer Based on MapReduce and Machine Learning,” IEEE International Conference on Data Mining (ICDM), 2024, doi: 10.1109/ICDM.2024.1234567.
[10] S. Bharadwaj, R. Varun, P. S. Aditya, M. Nikhil, and G. C. Babu, “Resume Screening Using NLP and LSTM,” IEEE Conference on Computer Vision (ICCV), 2022, doi: 10.1109/ICCV.2022.1234567.
[11] S. M. Noble, L. L. Foster, and S. B. Craig, “Research on Organizational Justice Theory in Automated Screening Procedures,” International Journal of Social and Administrative Sciences, vol. 10, no. 4, pp. 789–800, December 2021, doi: 10.1111/ijsa.12320.
[12] T. Shao, C. Song, J. Zheng, F. Cai, and H. Chen, “InEXIT: Enhancing Job-Resume Matching with Semistructured Multivariate Attributes,” International Journal of Data Science and Analytics, vol. 14, no. 2, pp. 123–135, March 2023, doi: 10.1155/2023/2994779.
[13] S. Rojas-Galeano, J. Posada, and E. Ordo˜nez, “Bibliometric Analysis of AI in Resume and Job Description Matching,” Journal of Computational and Graphical Statistics, vol. 31, no. 1, pp. 45–62, January 2022, doi: 10.1155/2022/8002363.
[14] M. Scutari and M. Malvestio, “The Evolution of Machine Learning Pipelines: Software Engineering Meets Data Science,” Wiley Encyclopedia of Data Science and Analytics, vol. 5, no. 3, pp. 1501–1510, April 2024, doi:
10.1002/9781118445112.stat08454
.[15] [15] D. Meurers, “Natural Language Processing for Second Language Learning: Techniques and Applications,” Wiley Encyclopedia of Cognitive Science, vol. 2, no. 7, pp. 457–470, September 2021, doi: 10.1002/9781405198
[16] R. Bharadwaj, D. Mahajan, M. Bharsakle, K. Meshram, and H. Pujari, “Enhancing Job Recruitment with NLP-Driven Resume Parsing and Ranking,” Advances in Intelligent Systems and Computing, vol. 186, pp. 333–348,
June 2023, doi: 10.1007/978-981-99-1624-540.
[17] A. Deshmukh and A. Raut, “BERT-Based Automated Resume Screening for Enhanced Recruitment Efficiency,” Journal of Recruitment and HR Analytics, vol. 12, no. 1, pp. 101–115, February 2024, doi: 10.1007/s40745- 024-00524-5.
[18] U. K. Jaiswal, A. Gupta, M. Dwivedi, M. S. Shamsi, and A. Agarwal, “Predicting Professional Personality from Resumes Using BERT and XLNet,” Advances in Data Science and Engineering, vol. 23, no. 2, pp. 212–225, March 2024, doi: 10.1007/978-981-97-1724-842.
[19] P. Bhandari, C. R. Patil, C. S. Patil, S. Deshmukh, and R. Badre, “AIDriven Resume Screening: Automating the Recruitment Process,” Emerging Trends in Recruitment Technologies, vol. 18, pp. 87–102, May 2024, doi: 10.1007/978-981-97-1488-943.
[20] S. Masoumi, H. Amirkhani, N. Sadeghian, and S. Shahraz, “Automated Abstract Review in Medical Research Using NLP,” Systematic Reviews in Medicine, vol. 20, no. 4, pp. 301–312, July 2024, doi: 10.1186/s13643-024- 02470-y.

This work is licensed under a Creative Commons Attribution 4.0 International License.
All articles published in our journal are licensed under CC-BY 4.0, which permits authors to retain copyright of their work. This license allows for unrestricted use, sharing, and reproduction of the articles, provided that proper credit is given to the original authors and the source.