loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Yahya Badran 1 ; 2 and Christine Preisach 1 ; 2

Affiliations: 1 Karlsruhe University of Education, Bismarckstr 10,76133 Karlsruhe, Germany ; 2 Karlsruhe University of Applied Sciences, Moltekstr. 30, 76133 Karlsruhe, Germany

Keyword(s): Knowledge Tracing, Deep Learning, Representation Learning, Knowledge Concepts.

Abstract: Knowledge tracing (KT) models aim to predict students’ future performance based on their historical interactions. Most existing KT models rely exclusively on human-defined knowledge concepts (KCs) associated with exercises. As a result, the effectiveness of these models is highly dependent on the quality and completeness of the predefined KCs. Human errors in labeling and the cost of covering all potential underlying KCs can limit model performance. In this paper, we propose a KT model, Sparse Binary Representation KT (SBRKT), that generates new KC labels, referred to as auxiliary KCs, which can augment the predefined KCs to address the limitations of relying solely on human-defined KCs. These are learned through a binary vector representation, where each bit indicates the presence (one) or absence (zero) of an auxiliary KC. The resulting discrete representation allows these auxiliary KCs to be utilized in training any KT model that incorporates KCs. Unlike pre-trained dense embeddin gs, which are limited to models designed to accept such vectors, our discrete representations are compatible with both classical models, such as Bayesian Knowledge Tracing (BKT), and modern deep learning approaches. To generate this discrete representation, SBRKT employs a binariza-tion method that learns a sparse representation, fully trainable via stochastic gradient descent. Additionally, SBRKT incorporates a recurrent neural network (RNN) to capture temporal dynamics and predict future student responses by effectively combining the auxiliary and predefined KCs. Experimental results demonstrate that SBRKT outperforms the tested baselines on several datasets and achieves competitive performance on others. Furthermore, incorporating the learned auxiliary KCs consistently enhances the performance of BKT across all tested datasets. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.191.154.119

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Badran, Y. and Preisach, C. (2025). Sparse Binary Representation Learning for Knowledge Tracing. In Proceedings of the 17th International Conference on Computer Supported Education - Volume 2: CSEDU; ISBN 978-989-758-746-7; ISSN 2184-5026, SciTePress, pages 75-84. DOI: 10.5220/0013275100003932

@conference{csedu25,
author={Yahya Badran and Christine Preisach},
title={Sparse Binary Representation Learning for Knowledge Tracing},
booktitle={Proceedings of the 17th International Conference on Computer Supported Education - Volume 2: CSEDU},
year={2025},
pages={75-84},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013275100003932},
isbn={978-989-758-746-7},
issn={2184-5026},
}

TY - CONF

JO - Proceedings of the 17th International Conference on Computer Supported Education - Volume 2: CSEDU
TI - Sparse Binary Representation Learning for Knowledge Tracing
SN - 978-989-758-746-7
IS - 2184-5026
AU - Badran, Y.
AU - Preisach, C.
PY - 2025
SP - 75
EP - 84
DO - 10.5220/0013275100003932
PB - SciTePress