Building student’s performance decision tree classifier using boosting algorithm

28Citations
Citations of this article
57Readers
Mendeley users who have this article in their library.

Abstract

Student‟s performance is the most important value of the educational institutes for their competitiveness. In order to improve the value, they need to predict student‟s performance, so they can give special treatment to the student that predicted as low performer. In this paper, we propose 3 boosting algorithms (C5.0, adaBoost.M1, and adaBoost.SAMME) to build the classifier for predicting student‟s performance. This research used 1UCI student performance datasets. There are 3 scenarios of evaluation, the first scenario employs 10-fold cross-validation to compare the performance of boosting algorithms. The result of the first scenario showed that adaBoost.SAMME and adaBoost.M1 outperform baseline method in binary classification. The second scenario was used to evaluate boosting algorithms under the different number of training data. On the second scenario, adaBoost.M1 has outperformed another boosting algorithms and baseline method on the binary classification. The third scenario, we build models from one subject dataset and test using another subject dataset. The third scenario results indicate that it can build prediction model using one subject to predict another subject.

Cite

CITATION STYLE

APA

Jauhari, F., & Supianto, A. A. (2019). Building student’s performance decision tree classifier using boosting algorithm. Indonesian Journal of Electrical Engineering and Computer Science, 14(3), 1298–1304. https://doi.org/10.11591/ijeecs.v14.i3.pp1298-1304

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free