arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.15470cs.CYcs.LG
收藏

DAGKT:基于图的知识追踪的困难与尝试

DAGKT: Difficulty and Attempts Boosted Graph-based Knowledge Tracing

Hefei University of Technology(合肥工业大学);Jianzai Tech(建在科技)

Rui Luo, Fei Liu, Wenhao Liang, Yuhong Zhang, Chenyang Bu, Xuegang Hu

摘要:

在智能教育领域,知识追踪(KT)越来越受到关注,它通过对学生掌握的知识概念进行估计和追踪,以提供高质量的教育。在KT模型中,问题和知识概念之间存在着自然的图结构,因此一些研究探索了图神经网络(GNNs)的应用,以改善没有使用图结构的KT模型的性能。然而,大多数教师忽视了问题的难度和学生的提问尝试。实际上,知识概念相同的试题难度不同,学生尝试的不同也代表着知识掌握的不同。在本文中,我们提出了一个困难和尝试推进基于图的KT(DAGKT),利用丰富的信息,从学生的记录。此外,设计了一种新的方法来建立问题的相似性关系的启发F1得分。在三个真实数据集上的实验证明了DAGKT的有效性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑