IDEAS home Printed from https://ideas.repec.org/a/gvu/itdw00/v5y2023i3id1374.html

Placement Analysis for Students using Machine Learning

Author

Listed:
  • C. M. Nalayani
  • Thanga Akilan .V
  • Hariharan .S
  • SaranArulnathan
  • Venkatanathan .S

Abstract

Every University/College want their students to get placed in a good company with a better package. They create the syllabus so, that students will gain the most knowledge out of the study period. But they are not sure whether the students are getting trained with proper guidance and instruction to be placed. There is a need for metric to find the progress of the student’s placement. So, the student can speed up his/her preparation to meet the demands of the minimum criteria of placement. This metric is called the placement analysis system, it takes attributes like internships completed, papers published, aptitude scores, etc to predict where the individual will get placed i.e., Dream company, Core company, Normal company or not get placed. For this the machine learning algorithms are used to predict the results using three basic algorithms Random Forest, Decision tree and K-means clustering the accuracy of the algorithms are determined to find the optimal algorithm. The past data on the placement results were fed as the training dataset and a part of it is used for testing the accuracy of the model. Then if the accuracy is good, this can be used to predict the possibility of a student getting placed. If the student is unhappy with the result, then the model can be used to find the area where the student needs to improve to get to his desired goal. If properly implemented and the students work consistently, this aids in providing solutions to meet every student's goal.

Suggested Citation

Handle: RePEc:gvu:itdw00:v:5:y:2023:i:3:id:1374
DOI: 10.36548/jitdw.2023.3.001
as

Download full text from publisher

File URL: https://irojournals.com/itdw/article/view/1374
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/itdw/article/download/1374/1231
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jitdw.2023.3.001?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:itdw00:v:5:y:2023:i:3:id:1374. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/itdw .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.