{"title":"早期预测学生成绩的决策树","authors":"Eyman A. Alyahyan, Dilek Düşteaör","doi":"10.1109/ICCIS49240.2020.9257646","DOIUrl":null,"url":null,"abstract":"The prediction of students' academic achievement is crucial to be conducted in a university for early detection of students at risk. This paper aims to present data mining models using classification methods based on Decision Trees (DT) algorithms to predict students' academic achievement after preparatory year, and to identify the algorithm that yields best performance. The students' academic achievement is defined as High, Average, or Below Average based on graduation CGPA. Three classifiers (J48, Random Tree and REPTree) are applied on a newly created dataset consisting of 339 students and 15 features, at the College of Computer Science and Information Technology (CCSIT). The outcome showed the J48 algorithm had an overall superior performance compared to other algorithms. Feature selection algorithms were used to reduce the feature vectors from 15 to 4 resulting in improvements in performance and computational efficiency. Finally, the results obtained help to pinpoint the preparatory year courses that impact graduation CGPA. Timely warnings, and preemptive counseling towards improving academic achievement is possible now.","PeriodicalId":425637,"journal":{"name":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Decision Trees for Very Early Prediction of Student's Achievement\",\"authors\":\"Eyman A. Alyahyan, Dilek Düşteaör\",\"doi\":\"10.1109/ICCIS49240.2020.9257646\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The prediction of students' academic achievement is crucial to be conducted in a university for early detection of students at risk. This paper aims to present data mining models using classification methods based on Decision Trees (DT) algorithms to predict students' academic achievement after preparatory year, and to identify the algorithm that yields best performance. The students' academic achievement is defined as High, Average, or Below Average based on graduation CGPA. Three classifiers (J48, Random Tree and REPTree) are applied on a newly created dataset consisting of 339 students and 15 features, at the College of Computer Science and Information Technology (CCSIT). The outcome showed the J48 algorithm had an overall superior performance compared to other algorithms. Feature selection algorithms were used to reduce the feature vectors from 15 to 4 resulting in improvements in performance and computational efficiency. Finally, the results obtained help to pinpoint the preparatory year courses that impact graduation CGPA. Timely warnings, and preemptive counseling towards improving academic achievement is possible now.\",\"PeriodicalId\":425637,\"journal\":{\"name\":\"2020 2nd International Conference on Computer and Information Sciences (ICCIS)\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 2nd International Conference on Computer and Information Sciences (ICCIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS49240.2020.9257646\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS49240.2020.9257646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
摘要
对学生的学业成绩进行预测对于早期发现有风险的学生是至关重要的。本文旨在提出使用基于决策树(DT)算法的分类方法的数据挖掘模型,以预测学生在预科后的学业成绩,并确定产生最佳性能的算法。学生的学业成绩被定义为高,平均,或低于平均基于毕业CGPA。三种分类器(J48, Random Tree和REPTree)应用于计算机科学与信息技术学院(CCSIT)新创建的由339名学生和15个特征组成的数据集。结果表明,与其他算法相比,J48算法总体上具有优越的性能。使用特征选择算法将特征向量从15个减少到4个,从而提高了性能和计算效率。最后,所得结果有助于确定影响毕业CGPA的预科课程。为了提高学习成绩,及时的警告和先发制人的咨询现在是可能的。
Decision Trees for Very Early Prediction of Student's Achievement
The prediction of students' academic achievement is crucial to be conducted in a university for early detection of students at risk. This paper aims to present data mining models using classification methods based on Decision Trees (DT) algorithms to predict students' academic achievement after preparatory year, and to identify the algorithm that yields best performance. The students' academic achievement is defined as High, Average, or Below Average based on graduation CGPA. Three classifiers (J48, Random Tree and REPTree) are applied on a newly created dataset consisting of 339 students and 15 features, at the College of Computer Science and Information Technology (CCSIT). The outcome showed the J48 algorithm had an overall superior performance compared to other algorithms. Feature selection algorithms were used to reduce the feature vectors from 15 to 4 resulting in improvements in performance and computational efficiency. Finally, the results obtained help to pinpoint the preparatory year courses that impact graduation CGPA. Timely warnings, and preemptive counseling towards improving academic achievement is possible now.