DAGKT: Difficulty and Attempts Boosted Graph-based Knowledge Tracing

Rui Luo, Fei-Tsung Liu, Wen-yao Liang, Yuhong Zhang, Chenyang Bu, Xuegang Hu
{"title":"DAGKT: Difficulty and Attempts Boosted Graph-based Knowledge Tracing","authors":"Rui Luo, Fei-Tsung Liu, Wen-yao Liang, Yuhong Zhang, Chenyang Bu, Xuegang Hu","doi":"10.48550/arXiv.2210.15470","DOIUrl":null,"url":null,"abstract":"In the field of intelligent education, knowledge tracing (KT) has attracted increasing attention, which estimates and traces students' mastery of knowledge concepts to provide high-quality education. In KT, there are natural graph structures among questions and knowledge concepts so some studies explored the application of graph neural networks (GNNs) to improve the performance of the KT models which have not used graph structure. However, most of them ignored both the questions' difficulties and students' attempts at questions. Actually, questions with the same knowledge concepts have different difficulties, and students' different attempts also represent different knowledge mastery. In this paper, we propose a difficulty and attempts boosted graph-based KT (DAGKT), using rich information from students' records. Moreover, a novel method is designed to establish the question similarity relationship inspired by the F1 score. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed DAGKT.","PeriodicalId":281152,"journal":{"name":"International Conference on Neural Information Processing","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Neural Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2210.15470","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In the field of intelligent education, knowledge tracing (KT) has attracted increasing attention, which estimates and traces students' mastery of knowledge concepts to provide high-quality education. In KT, there are natural graph structures among questions and knowledge concepts so some studies explored the application of graph neural networks (GNNs) to improve the performance of the KT models which have not used graph structure. However, most of them ignored both the questions' difficulties and students' attempts at questions. Actually, questions with the same knowledge concepts have different difficulties, and students' different attempts also represent different knowledge mastery. In this paper, we propose a difficulty and attempts boosted graph-based KT (DAGKT), using rich information from students' records. Moreover, a novel method is designed to establish the question similarity relationship inspired by the F1 score. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed DAGKT.
DAGKT:难度和尝试提高了基于图的知识追踪
在智能教育领域,知识追踪(knowledge tracing, KT)越来越受到关注,它可以对学生对知识概念的掌握情况进行评估和追踪,从而提供高质量的教育。在KT中,问题和知识概念之间存在着天然的图结构,因此一些研究探索了应用图神经网络(gnn)来改进未使用图结构的KT模型的性能。然而,他们大多忽视了问题的难度和学生对问题的尝试。实际上,相同知识概念的题目难度不同,学生的不同尝试也代表着对知识掌握程度的不同。在本文中,我们提出了一个难度和尝试增强的基于图形的KT (DAGKT),利用丰富的学生记录信息。在此基础上,设计了一种基于F1分数建立问题相似度关系的新方法。在三个真实数据集上的大量实验证明了所提出的DAGKT的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信