Efficient Knowledge Tracing Leveraging Higher-Order Information in Integrated Graphs

Donghee Han, Daehee Kim, Minjun Lee, Daeyoung Roh, Keejun Han +1 more
7/24/2025
cs.LGcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

The rise of online learning has led to the development of various knowledge tracing (KT) methods. However, existing methods have overlooked the problem of increasing computational cost when utilizing large graphs and long learning sequences. To address this issue, we introduce Dual Graph Attention-based Knowledge Tracing (DGAKT), a graph neural network model designed to leverage high-order information from subgraphs representing student-exercise-KC relationships. DGAKT incorporates a subgraph-based approach to enhance computational efficiency. By processing only relevant subgraphs for each target interaction, DGAKT significantly reduces memory and computational requirements compared to full global graph models. Extensive experimental results demonstrate that DGAKT not only outperforms existing KT models but also sets a new standard in resource efficiency, addressing a critical need that has been largely overlooked by prior KT approaches.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{han2025efficient,
  title  = {Efficient Knowledge Tracing Leveraging Higher-Order Information in Integrated Graphs},
  author = {Donghee Han and Daehee Kim and Minjun Lee and Daeyoung Roh and Keejun Han and Mun Yong Yi},
  year   = {2025},
  eprint = {2507.18668},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.18668v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.18668.svg)](https://codeofpaper.com/paper/2507.18668)

Discussion