Analysis Model of Students Learning Behavior Based on Extreme Random Forest Classification Algorithm

IF 0.5 Q4 AUTOMATION & CONTROL SYSTEMS
Yan Yang,  Yi Qu
{"title":"Analysis Model of Students Learning Behavior Based on Extreme Random Forest Classification Algorithm","authors":"Yan Yang,&nbsp; Yi Qu","doi":"10.3103/S0146411626700124","DOIUrl":null,"url":null,"abstract":"<p>With the continuous development of information technology, under the existing teaching environment and the degree of informationization, relying only on teachers to pay attention to each student’s learning situation is not able to accurately analyze the students' status. To solve this issue, the study suggests a hierarchical multilabel classification technique based on clustering relationships. Using the integration principle, the clustered clustering tree is built as a random forest classification model after the labels in the sample set are clustered using the K-mean clustering method. Moreover, the random forest classification model is improved to address the problem of reduced classification effect caused by the increased randomness of the decision tree. The outcomes indicated that the accuracy of the multilabel classification algorithm with clustered relationships was 95.6%, the false alarm rate was 2.3%, the F1 value was 0.97, and the root-mean-square error value was 0.12 at a training set size of 800. The accuracy of the random forest algorithm, the K-nearest neighbor algorithm, and the adaptive extreme random forest classification algorithm models were 0.49, 0.61, and 0.75 at a training set size of 1000, respectively. At a validation set size of 500, the accuracy of the three algorithm models was 0.41, 0.47, and 0.64, respectively. The outcomes demonstrated that the proposed improved algorithmic model has a better performance compared to other methods, which can improve the level of education informatization and promote the intelligent development of education and teaching.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"60 1","pages":"120 - 131"},"PeriodicalIF":0.5000,"publicationDate":"2026-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0146411626700124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the continuous development of information technology, under the existing teaching environment and the degree of informationization, relying only on teachers to pay attention to each student’s learning situation is not able to accurately analyze the students' status. To solve this issue, the study suggests a hierarchical multilabel classification technique based on clustering relationships. Using the integration principle, the clustered clustering tree is built as a random forest classification model after the labels in the sample set are clustered using the K-mean clustering method. Moreover, the random forest classification model is improved to address the problem of reduced classification effect caused by the increased randomness of the decision tree. The outcomes indicated that the accuracy of the multilabel classification algorithm with clustered relationships was 95.6%, the false alarm rate was 2.3%, the F1 value was 0.97, and the root-mean-square error value was 0.12 at a training set size of 800. The accuracy of the random forest algorithm, the K-nearest neighbor algorithm, and the adaptive extreme random forest classification algorithm models were 0.49, 0.61, and 0.75 at a training set size of 1000, respectively. At a validation set size of 500, the accuracy of the three algorithm models was 0.41, 0.47, and 0.64, respectively. The outcomes demonstrated that the proposed improved algorithmic model has a better performance compared to other methods, which can improve the level of education informatization and promote the intelligent development of education and teaching.

Abstract Image

基于极端随机森林分类算法的学生学习行为分析模型
随着信息技术的不断发展,在现有的教学环境和信息化程度下,仅仅依靠教师关注每个学生的学习情况是无法准确分析学生的状态的。为了解决这个问题,本研究提出了一种基于聚类关系的分层多标签分类技术。利用积分原理,将样本集中的标签采用k均值聚类方法聚类后,构建聚类聚类树作为随机森林分类模型。改进了随机森林分类模型,解决了决策树随机性增加导致分类效果降低的问题。结果表明,在训练集规模为800时,具有聚类关系的多标签分类算法准确率为95.6%,误报率为2.3%,F1值为0.97,均方根误差值为0.12。在训练集规模为1000时,随机森林算法、k近邻算法和自适应极端随机森林分类算法模型的准确率分别为0.49、0.61和0.75。在验证集规模为500时,三种算法模型的准确率分别为0.41、0.47和0.64。结果表明,所提出的改进算法模型相比其他方法具有更好的性能,能够提高教育信息化水平,促进教育教学的智能化发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
AUTOMATIC CONTROL AND COMPUTER SCIENCES
AUTOMATIC CONTROL AND COMPUTER SCIENCES AUTOMATION & CONTROL SYSTEMS-
CiteScore
1.70
自引率
22.20%
发文量
47
期刊介绍: Automatic Control and Computer Sciences is a peer reviewed journal that publishes articles on• Control systems, cyber-physical system, real-time systems, robotics, smart sensors, embedded intelligence • Network information technologies, information security, statistical methods of data processing, distributed artificial intelligence, complex systems modeling, knowledge representation, processing and management • Signal and image processing, machine learning, machine perception, computer vision
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书