论文标题

dagkt:难度和尝试增强基于图的知识跟踪

DAGKT: Difficulty and Attempts Boosted Graph-based Knowledge Tracing

论文作者

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

论文摘要

在智能教育领域,知识追踪(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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源