Enhanced Butterfly Optimization and Deep Learning Algorithm for Student Placement Prediction
DOI:
https://doi.org/10.62760/iteecs.4.2.2025.139Keywords:
Campus placement (CP), K-Means Clustering (KMC) algorithm, Enhanced Butterfly optimization algorithm (EBOA), Deep learning (DL) algorithm, Improved Long short-term memory (ILSTM).Abstract
Campus Placement (CP) is regarded in India as a crucial factor in determining universities or college's ranking and recognition. A university's standing and reputation are greatly influenced by the number of students it places in jobs and the average compensation offered to those students. It would be extremely beneficial to develop Deep Learning (DL)-based algorithms that can assist individuals in getting placement guidance, analyses labor market trends, and help educational institutions evaluate opportunities and expanding fields. Numerous realistic and potential placement criteria, such as the kinds of organizations a junior year student can be put in or the companies that are likely to seek out a student's particular skill sets, can be estimated with the use of a DL model based on Predictive Analysis (PA). The Objectives can be predicted using a variety of characteristics, including projects, technical proficiency, training experiences, and academic performance. Initially, pre-processing is applied on the student placement dataset using K-Means Clustering (KMC) algorithm which handles the Missing Values (MV) and error values efficiently. Then, Enhanced Butterfly optimization algorithm (EBOA) is used to select the best students for placement based on their qualities. It is done by generating the optimal Fitness Values (FV). At last, the DL algorithm Improved Long Short-Term Memory (ILSTM) is used for predicting student placement and the results are superior. It is used to assist students and educational institutions in navigating the multifaceted landscape of placement prediction. Finding pupils with academic potential is assisted by this study. Their prospects of getting a placement are increased because this course allows students to concentrate on and develop their social and technical abilities. From the result, it proved that the suggested ILSTM based DL algorithm gives superior performance by means of greater Accuracy (Acc), Precision (P), Recall (R) and f-measure rather than the existing algorithms.
References
Z. Wang, G. Liang, and H. Chen “Tool for predicting college student career decisions: an enhanced support vector machine framework”, Applied Sciences, Vol. 12, No. 9, art. no. 4776, 2022.
https://doi.org/10.3390/app12094776
A. K. Srivastava, V. Tripathi, and B. Pant “Computer Vision based Online Job Interview Proctoring for Campus Placement”, 2024 11th International Conference on Computing for Sustainable Global Development (INDIACom), pp. 663-668, 2024.
https://doi.org/10.23919/INDIACom61295.2024.10499075
D. S. Kumar, Z. B. Siri, D. S. Rao, and S. Anusha “Predicting student’s campus placement probability using binary logistic regression”, International Journal of Innovative Technology and Exploring Engineering, Vol. 8, No.9, pp. 2633-2635, 2019.
http://dx.doi.org/10.35940/ijitee.I8984.078919
M. S. Byagar, R. Patil, and J. Pawar “Maximizing Campus Placement Through Machine Learning”, Journal of Advanced Zoology, Vol. 45, No. S4, pp. 06-12, 2024.
https://doi.org/10.53555/jaz.v45iS4.4141
A. Gupta, S. Gupta, P. K. Mall, S. Srivastava, A. S. Saluja, N. Yadav, V. Narayan, M. K. Verma, and S. Sriramulu “ML-CPC: A Pathway for Machine Learning Based Campus Placement Classification”, Journal of Electrical Systems, Vol. 20, No. 3s, pp. 1453-1464, 2024.
https://doi.org/10.52783/jes.1521
P. Thakar, and A. Mehta, Manisha “A unified model of clustering and classification to improve students’ employability prediction”, International Journal of Intelligent Systems and Applications, Vol. 9, No. 9, pp. 10-18, 2017.
http://dx.doi.org/10.5815/ijisa.2017.09.02
H. Sriwindono, P. P. Rosa, and K. Pinaryanto “The Teacher Placement using K-Means Clustering and Genetic Algorithm. Conference Series, Vol. 4, pp. 43-51, 2022.
http://dx.doi.org/10.34306/conferenceseries.v4i1.669
N. Premalatha, and S. Sujatha “Prediction of students’ employability using clustering algorithm: A hybrid approach”, International Journal of Modeling, Simulation, and Scientific Computing, Vol. 13, No. 06, art. no. 2250049, 2022.
http://dx.doi.org/10.1142/S1793962322500490
T. Maragatham, P. Yuvarani, S. Harishri, and R. Swetha. “Student Placement Prediction using Deep Learning Techniques”, 2024 8th International Conference on Electronics, Communication and Aerospace Technology (ICECA), pp. 620-626, 2024.
https://doi.org/10.1109/ICECA63461.2024.10800998
S. Arora, and S. Singh, “Butterfly optimization algorithm: a novel approach for global optimization”, Soft computing, Vol. 23, pp. 715-734, 2019.
https://doi.org/10.1007/s00500-018-3102-4
S. S. Yu, S. W. Chu, C. M. Wang, Y. K. Chan, and T. C. Chang “Two improved k-means algorithms”, Applied Soft Computing, Vol. 68, pp. 747-755, 2018.
https://doi.org/10.1016/j.asoc.2017.08.032
K. P. Sinaga, and M. S. Yang “Unsupervised K-means clustering algorithm”, IEEE Access, Vol. 8, pp. 80716-80727, 2020.
https://doi.org/10.1109/ACCESS.2020.2988796
M. Cui, “Introduction to the k-means clustering algorithm based on the elbow method”, Accounting, Auditing and Finance, Vol. 1, No. 1, pp. 5-8, 2020.
H. Amin “Clustering Analysis of Admission of New Students Using K-Means Clustering and K-Medoids Algorithms to Increase Campus Marketing Potential”, Tech-E, Vol. 7, No. 1, pp. 43-56, 2023.
http://dx.doi.org/10.31253/te.v7i1.2264
L. Kesheng, N. Yikun, L. Zihan, and D. Bin “Data mining and feature analysis of college students’ campus network behaviour”, 2020 5th IEEE International Conference on Big Data Analytics (ICBDA), pp. 231-237, 2020.
https://doi.org/10.1109/ICBDA49040.2020.9101257
Z. Liang, X. Di, Z. Liu, X. Liu, X. Zhang, and Z. Yu “Predicting students’ academic performance based on improved PSO-Xgboost: a campus behavior perspective”, International Conference on Algorithms and Architectures for Parallel Processing, pp. 402-421, 2021.
https://doi.org/10.1007/978-3-030-95384-3_26
M. Jain, V. Saihjpal, N. Singh, and S. B. Singh “An overview of variants and advancements of PSO algorithm”, Applied Sciences, Vol. 12, No. 17, art. no. 8392, 2022.
http://dx.doi.org/10.3390/app12178392
F. A. ?enel, F. Gökçe, A. S. Yüksel, and T. Yi?it “A novel hybrid PSO–GWO algorithm for optimization problems”, Engineering with Computers, Vol. 35, pp. 1359-1373, 2019.
https://link.springer.com/article/10.1007/s00366-018-0668-5
X. S. Yang “Metaheuristic optimization: Nature-inspired algorithms and applications”, Artificial intelligence, Evolutionary computing and Metaheuristics, Vol. 4, No. 27, pp. 405-420, 2013.
https://doi.org/10.1007/978-3-642-29694-9_16
S. N. Makhadmeh, M. A. Al-Betar, A. K. Abasi, M.A. Awadallah, I. A. Doush, Z. A. A. Alyasseri, and O. A. Alomari “Recent advances in butterfly optimization algorithm, its versions and applications”, Archives of Computational Methods in Engineering, Vol. 30, No. 2, pp. 1399-1420, 2023.
https://doi.org/10.1007/s11831-022-09843-3
M. Alweshah, S. A. Khalaileh, B. B. Gupta, A. Almomani, A. I. Hammouri, and M. A. A. Betar “The monarch butterfly optimization algorithm for solving feature selection problems”, Neural Computing and Applications, Vol. 34, pp. 11267-11281, 2022.
https://doi.org/10.1007/s00521-020-05210-0
A. B. Nadaf, S. S. Reddy, R. Sanwal, T. Thulasimani, K. K. V. Satyanarayana, and M. Krishnaraj “An Efficient Method for Empowering engineering students through employability skills Based on New A-ResNet-LSTM Model”, 2024 3rd International Conference for Advancement in Technology (ICONAT), pp. 1-6, 2024.
https://doi.org/10.1109/ICONAT61936.2024.10775238
O. Ahmad, and B. Farooq “Auxiliary-LSTM based floor-level occupancy prediction using Wi-Fi access point logs”, Journal of Smart Cities and Society, Vol. 1, No. 3, pp. 195-211, 2022.
Additional Files
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 T. Kavi Priya, N. Kumar
This work is licensed under a Creative Commons Attribution 4.0 International License.
This Journal and its metadata are licenced under a 