Machine Learning Approaches Towards Resume Classification

[{“box”:0,”content”:”[if 992 equals=”Open Access”]n

n

n

n

Open Access

nn

n

n[/if 992]n

n

Year : May 10, 2024 at 4:02 pm | [if 1553 equals=””] Volume :01 [else] Volume :01[/if 1553] | [if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424] : 02 | Page : 1-7

n

n

n

n

n

n

By

n

[foreach 286]n

n

n

Subhajit Das, Saswati Naskar, Swapna Halder

n

    n t

  • n

n

n[/foreach]

n

n[if 2099 not_equal=”Yes”]n

    [foreach 286] [if 1175 not_equal=””]n t

  1. Student, Student, Student, Greater Kolkata College of Engineering and Management, Greater Kolkata College of Engineering and Management, Greater Kolkata College of Engineering and Management, West Bengal, West Bengal, West Bengal, India, India, India
  2. n[/if 1175][/foreach]

n[/if 2099][if 2099 equals=”Yes”][/if 2099]n

n

Abstract

nFinding the right person for an open position can be an unnerving task, especially when there are many applicants, and if the recruiter or the Human Resources department must sort and further categorize all those resumes then it will be a labor-intensive, time-consuming, and tiresome task. Another thing is that human review of resumes can be prone to bias and errors. Manually screening the proper candidate’s resume from the pool is not practicable; instead, an automated method using natural language processing may assist in selecting the appropriate candidate’s resume. The proposed web application is built so that job applicants and recruiters can use it easily for applying for job opportunities and screening, respectively. This study aims to revolutionize resume classification through the lens of machine learning. Unlike previous approaches, we provide a unique framework that combines advanced machine learning algorithms with complex feature engineering techniques. So, this can hamper the decision-making process and lead to delays in the hiring process. We examine the model architectures, assessment measures, feature extraction strategies, and underlying processes that went into creating and developing these systems. We also look at case studies and real-world applications to show the difficulties and benefits of using machine learning for resume screening. As a result, the company’s overall growth will be hindered. An efficient resume classification process will ease the hiring process. Machine learning algorithms like Regular Expression, Multinomial Naïve Bayes, Logistic Regression, Random Forest, SVM, etc. have been used for Resume Classification.

n

n

n

Keywords: Artificial Intelligence, Machine Learning, Logistic Regression, SVM, Naïve Bayes

n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Electronics Automation(ijea)]

n

[/if 424][if 424 equals=”Special Issue”][This article belongs to Special Issue under section in International Journal of Electronics Automation(ijea)][/if 424][if 424 equals=”Conference”]This article belongs to Conference [/if 424]

n

n

n

How to cite this article: Subhajit Das, Saswati Naskar, Swapna Halder. Machine Learning Approaches Towards Resume Classification. International Journal of Electronics Automation. May 10, 2024; 01(02):1-7.

n

How to cite this URL: Subhajit Das, Saswati Naskar, Swapna Halder. Machine Learning Approaches Towards Resume Classification. International Journal of Electronics Automation. May 10, 2024; 01(02):1-7. Available from: https://journals.stmjournals.com/ijea/article=May 10, 2024/view=0

nn


nn[if 992 equals=”Open Access”] Full Text PDF Download[/if 992]

[if 379 not_equal=””]n

Browse Figures

n

n

[foreach 379]n

n[/foreach]n

nn

n

n[/if 379]n

n

References

n[if 1104 equals=””]n

  1. Balci B, Saadati D, Shiferaw D Handwritten text recognition using deep learning. 1–8p.
  2. Kim SW, Gil J-M Research paper classification systems based on TF-IDF and LDA schemes. Human-centric Computing and Information Sciences 2019; 9(30): 1–21p.
  3. Berger, A & Lafferty, J. (1999). Information Retrieval as Statistical Translation. In Proceedings of the 22nd ACM Conference on Research and Development in Information Retrieval (SIGIRí99), 222–229.
  4. Friedman C, Hripcsak G Natural language processing and its future in medicine. Academic medicine: Journal of the Association of the American Medical Colleges 1999; 74(8): 890–5p.
  5. Ramos J Using TF-IDF to determine word relevance in document queries. 1999.
  6. Yi X, Allan J, Croft, WB Matching resumes, and jobs based on relevance models. Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 2007.
  7. Rodney, K. Valaskova and P. Durana, “The artificial intelligence recruitment process: how technological advancements have reshaped job application and selection practices,” Psychosociological Issues in Human Resource Management, vol. 7, no. 1, pp. 2–47, 2019.
  8. Mwaro PN, Ogada DK, Cheruiyot W, SCIT J. Applicability of naïve Bayes model for automatic resume classification. International Journal of Computer Applications Technology and Research. 2020;9(9):257–
  9. Roy PK, Singh SK, Das TK, Tripathy AK. Automated Resume Classification Using Machine Learning. Advances in Distributed Computing and Machine Learning: Proceedings of ICADCML 2022 2022 Jul 28 (pp. 307-316). Singapore: Springer Nature Singapore.
  10. Joachims. Making large-scale support vector machine learning practical. In Advances in Kernel Methods: Support Vector Learning. B. Schölkopf, C.J.C. Burges, and A.J. Smola (Eds.), MIT Press, 1998.
  11. Rosenblatt. The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review, 65:386-408, 1959.

nn[/if 1104][if 1104 not_equal=””]n

    [foreach 1102]n t

  1. [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
  2. n[/foreach]

n[/if 1104]

nn


nn[if 1114 equals=”Yes”]n

n[/if 1114]

n

n

[if 424 not_equal=””]Regular Issue[else]Published[/if 424] Subscription Review Article

n

n

[if 2146 equals=”Yes”][/if 2146][if 2146 not_equal=”Yes”][/if 2146]n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n[if 1748 not_equal=””]

[else]

[/if 1748]n

n

n

Volume 01
[if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424] 02
Received March 30, 2024
Accepted April 15, 2024
Published May 10, 2024

n

n

n

n

n

n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n”}]