Neural Attentive Knowledge Tracing Model for Student Performance Prediction

Junrui Zhang, Yun Mo, Changzhi Chen, Xiaofeng He
{"title":"Neural Attentive Knowledge Tracing Model for Student Performance Prediction","authors":"Junrui Zhang, Yun Mo, Changzhi Chen, Xiaofeng He","doi":"10.1109/ICBK50248.2020.00096","DOIUrl":null,"url":null,"abstract":"A large number of anonymous log files are collected from the online education platform, and it is of great educational significance to use efficient algorithms for mining student’s characteristics and predicting student’s performance. To the best of our knowledge, existing models lack attention to the long-term performance of students. The interpretability of the operating results is weak. In addition, these models simplify the tracking of student knowledge points and are essentially unable to capture the relationship between skills in multi-skill exercises. We propose a new model, NAKTM, which divides user features into long-term and short-term features, and uses both to comprehensively express student abilities. At the same time, it uses the skills involved in the exercises as much as possible to jointly represent the characteristics of the exercises. Finally, we use the bilinear matching scheme in the hidden space to calculate the similarity between the students’ ability and the exercises, and finally directly predict the learner’s performance at the exercise level at the next moment. The experiment shows that our model achieves good experimental results without special processing of datasets.","PeriodicalId":432857,"journal":{"name":"2020 IEEE International Conference on Knowledge Graph (ICKG)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Knowledge Graph (ICKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK50248.2020.00096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A large number of anonymous log files are collected from the online education platform, and it is of great educational significance to use efficient algorithms for mining student’s characteristics and predicting student’s performance. To the best of our knowledge, existing models lack attention to the long-term performance of students. The interpretability of the operating results is weak. In addition, these models simplify the tracking of student knowledge points and are essentially unable to capture the relationship between skills in multi-skill exercises. We propose a new model, NAKTM, which divides user features into long-term and short-term features, and uses both to comprehensively express student abilities. At the same time, it uses the skills involved in the exercises as much as possible to jointly represent the characteristics of the exercises. Finally, we use the bilinear matching scheme in the hidden space to calculate the similarity between the students’ ability and the exercises, and finally directly predict the learner’s performance at the exercise level at the next moment. The experiment shows that our model achieves good experimental results without special processing of datasets.
学生成绩预测的神经关注知识追踪模型
在线教育平台收集了大量的匿名日志文件,利用高效的算法挖掘学生特征,预测学生表现,具有重要的教育意义。据我们所知,现有的模式缺乏对学生长期表现的关注。操作结果的可解释性较弱。此外,这些模型简化了对学生知识点的跟踪,本质上无法捕捉多技能练习中技能之间的关系。我们提出了一个新的模型NAKTM,它将用户特征分为长期特征和短期特征,并利用两者来综合表达学生的能力。同时尽可能地运用练习中所涉及的技巧,共同表现出练习的特点。最后,我们使用隐藏空间的双线性匹配方案来计算学生能力与练习之间的相似度,最终直接预测学习者在下一时刻在练习层面的表现。实验表明,该模型在不需要对数据集进行特殊处理的情况下,取得了较好的实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信