Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
10.55041/IJSREM20938
Volume:
7 |
5 |
May 2023
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Based on the needs of the business, a placement predictor calculates the likelihood of placing a student there. The predictor considers a number of factors while determining the student’s proficiency. These factors are determined in part from assessments made inside the placement management system, and in part from surveys sent out to universities. Using all of this information, the predictor can accurately forecast whether or not a student will be hired by a business. The predictor is trained using historical data from previous students. By doing so, it helps in identifying the most suitable candidates for various company roles, thus improving the overall placement rate. In order to identify the most effective classification algorithm for our dataset, we faced the challenge of selecting one that would deliver maximum accuracy. We recognized that the performance of algorithms varies based on the specific problem and dataset they are tasked with. Consequently, we opted to evaluate four distinct algorithms: Multi-class methods such as KNN, SVM, Logistic Regression, and Random Forest. We evaluate the algorithms’ precision in light of our issue and data collection. we aimed to identify the most suitable algorithm for our predictor in the placement management system.
KEYWORDS
Publication Date
5/13/2023
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
1
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...