Abstract

Education is important nowadays because universities need to improve their students' skills so they can compete in the globalization era. Education can be obtained through both formal and informal channels, and knowledge is available everywhere, especially in today's world where information tools are rapidly evolving. Inactive students are students who do not participate in a course for a maximum of two consecutive semesters. Students who are not active have the opportunity to drop out of university studies. Students who drop out of college are usually motivated by economic factors, and the cessation of the lecture process can cause inactivity and administrative costs. Therefore, this research was conducted using the C4.5 algorithm method and the K-Nearest Neighbor (KNN) algorithm to compare and predict data on inactive students at Universitas Prima Indonesia. The research continued with the data collection and data preprocessing stages, after which the data mining process was carried out to get the final results of this research. The testing process follows the process of comparing the C4.5 algorithm and the K-Nearest Neighbor (KNN) algorithm with K-fold crossing. This evaluation step is compared by considering the comparison values of the confusion matrix (precision, precision, recall). The accuracy results obtained by each algorithm provide information about the effectiveness of using these techniques in processing the specified dataset. The accuracy of the Decision Tree C4.5 algorithm is 99.12% and the K-Nearest Neighbors algorithm is 99.14%. Based on research conducted using the K-Nearest Neighbors and C4.5 algorithms to predict inactive students, the KNN algorithm is more accurate than the C4.5 algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.