Abstract
Admission into dental school involves selecting applicants for successful completion of the course. This study aimed to predict the academic performance of Kulliyyah of Dentistry, International Islamic University Malaysia pre-clinical dental students based on admission results using artificial intelligence machine learning (ML) models, and Pearsoncorrelation coefficient (PCC). ML algorithms logistic regression (LR), decision tree (DT), random forest (RF), and support vector machine (SVM) models were applied. Academic performance prediction in pre-clinical years was made using three input parameters: age during admission, pre-university Cumulative Grade Point Average (CGPA), and total matriculation semester. PCC was deployed to identify the correlation between pre-university CGPA and dental school grades. The proposed models' classification accuracy ranged from 29% to 57%, ranked from highest to lowest as follows: RF, SVM, DT, and LR. Pre-university CGPA was shown to be predictive of dental students' academic performance; however, alone they did not yield optimal outcomes. RF was the most precise algorithm for predicting grades A, B, and C, followed by LR, DT, and SVM. In forecasting failure, LR predicted three grades with the highest recall, SVM predicted two grades, and DT predicted one. RF performance was insignificant. The findings demonstrated the application of ML algorithms and PCC to predict dental students' academic performance. However, it was limited by several factors. Each algorithm has unique performance qualities, and trade-offs between different performance metrics may be necessary. No definitive model stood out as the best algorithm for predicting student academic success in this study.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.