Applying Ensemble Classifier, K-Nearest Neighbor and Decision Tree for Predicting Oral Reading Rate Levels

Jwan Abdulkhaliq Mohammed
{"title":"Applying Ensemble Classifier, K-Nearest Neighbor and Decision Tree for Predicting Oral Reading Rate Levels","authors":"Jwan Abdulkhaliq Mohammed","doi":"10.30526/36.3.3102","DOIUrl":null,"url":null,"abstract":"For many years, reading rate as word correct per minute (WCPM) has been investigated by many researchers as an indicator of learners’ level of oral reading speed, accuracy, and comprehension. The aim of the study is to predict the levels of WCPM using three machine learning algorithms which are Ensemble Classifier (EC), Decision Tree (DT), and K- Nearest Neighbor (KNN). The data of this study were collected from 100 Kurdish EFL students in the 2nd-year, English language department, at the University of Duhok in 2021. The outcomes showed that the ensemble classifier (EC) obtained the highest accuracy of testing results with a value of 94%. Also, EC recorded the highest precision, recall, and F1 scores with values of 0.92 for the three performance measures. The Receiver Operating Character curve (ROC curve) also got the highest results than other classification algorithms. Accordingly, it can be concluded that the ensemble classifier is the best and most accurate model for predicting reading rate (accuracy) WCPM.    ","PeriodicalId":13022,"journal":{"name":"Ibn AL- Haitham Journal For Pure and Applied Sciences","volume":"62 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ibn AL- Haitham Journal For Pure and Applied Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30526/36.3.3102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

For many years, reading rate as word correct per minute (WCPM) has been investigated by many researchers as an indicator of learners’ level of oral reading speed, accuracy, and comprehension. The aim of the study is to predict the levels of WCPM using three machine learning algorithms which are Ensemble Classifier (EC), Decision Tree (DT), and K- Nearest Neighbor (KNN). The data of this study were collected from 100 Kurdish EFL students in the 2nd-year, English language department, at the University of Duhok in 2021. The outcomes showed that the ensemble classifier (EC) obtained the highest accuracy of testing results with a value of 94%. Also, EC recorded the highest precision, recall, and F1 scores with values of 0.92 for the three performance measures. The Receiver Operating Character curve (ROC curve) also got the highest results than other classification algorithms. Accordingly, it can be concluded that the ensemble classifier is the best and most accurate model for predicting reading rate (accuracy) WCPM.    
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
应用集成分类器、k近邻和决策树预测口语阅读速度水平
多年来,许多研究者将阅读率作为每分钟正确单词数(WCPM)作为学习者口语阅读速度、准确性和理解水平的指标进行了研究。该研究的目的是使用三种机器学习算法来预测WCPM的水平,这三种算法是集成分类器(EC)、决策树(DT)和K-最近邻(KNN)。本研究的数据是在2021年从杜胡克大学英语系二年级的100名库尔德语学生中收集的。结果表明,集成分类器(EC)的检测结果准确率最高,达到94%。此外,EC在三个绩效指标上的准确率、召回率和F1得分最高,为0.92。受试者工作特征曲线(Receiver Operating Character curve, ROC曲线)的分类效果也优于其他分类算法。综上所述,集成分类器是预测阅读率(准确率)WCPM的最佳和最准确的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
67
审稿时长
18 weeks
期刊最新文献
Fully Fuzzy Visible Modules With Other Related Concepts Applying Ensemble Classifier, K-Nearest Neighbor and Decision Tree for Predicting Oral Reading Rate Levels Double-Exponential-X Family of Distributions: Properties and Applications Study the Effect of Manganese Ion Doping on the Size- Strain of SnO2 nanoparticles Using X-Ray Diffraction Data Green Synthesis Zinc Nanoparticles in the Treatment of Heavy Metals in the form of Complexes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1