Temporal Graph Memory Networks For Knowledge Tracing

• URL: http://arxiv.org/abs/2410.01836v1
• Date: Mon, 23 Sep 2024 07:47:02 GMT
• Title: Temporal Graph Memory Networks For Knowledge Tracing
• Authors: Seif Gad, Sherif Abdelfattah, Ghodai Abdelrahman,
• Abstract summary: We propose a novel method that jointly models the relational and temporal dynamics of the knowledge state using a deep temporal graph memory network. We also propose a generic technique for representing a student's forgetting behavior using temporal decay constraints on the graph memory module.
• Score: 0.40964539027092906
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Tracing a student's knowledge growth given the past exercise answering is a vital objective in automatic tutoring systems to customize the learning experience. Yet, achieving this objective is a non-trivial task as it involves modeling the knowledge state across multiple knowledge components (KCs) while considering their temporal and relational dynamics during the learning process. Knowledge tracing methods have tackled this task by either modeling KCs' temporal dynamics using recurrent models or relational dynamics across KCs and questions using graph models. Albeit, there is a lack of methods that could learn joint embedding between relational and temporal dynamics of the task. Moreover, many methods that count for the impact of a student's forgetting behavior during the learning process use hand-crafted features, limiting their generalization on different scenarios. In this paper, we propose a novel method that jointly models the relational and temporal dynamics of the knowledge state using a deep temporal graph memory network. In addition, we propose a generic technique for representing a student's forgetting behavior using temporal decay constraints on the graph memory module. We demonstrate the effectiveness of our proposed method using multiple knowledge tracing benchmarks while comparing it to state-of-the-art methods.

Related papers

• DyGKT: Dynamic Graph Learning for Knowledge Tracing [27.886870568131254]
  This work is motivated by three dynamical characteristics: 1) The scales of students answering records are constantly growing; 2) The semantics of time intervals between the records vary; 3) The relationships between students, questions and concepts are evolving. Along this line, we propose a Dynamic Graph-based Knowledge Tracing model, namely DyGKT. In particular, a continuous-time dynamic question-answering graph for knowledge tracing is constructed to deal with the infinitely growing answering behaviors.
  arXiv  Detail & Related papers  (2024-07-30T13:43:32Z)
• Spatio-Temporal Branching for Motion Prediction using Motion Increments [55.68088298632865]
  Human motion prediction (HMP) has emerged as a popular research topic due to its diverse applications. Traditional methods rely on hand-crafted features and machine learning techniques. We propose a noveltemporal-temporal branching network using incremental information for HMP.
  arXiv  Detail & Related papers  (2023-08-02T12:04:28Z)
• DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graph [59.583555454424]
  We propose a novel disenTangled representation learning framework for discrete-time Dynamic graphs, namely DyTed. We specially design a temporal-clips contrastive learning task together with a structure contrastive learning to effectively identify the time-invariant and time-varying representations respectively.
  arXiv  Detail & Related papers  (2022-10-19T14:34:12Z)
• Temporal Relevance Analysis for Video Action Models [70.39411261685963]
  We first propose a new approach to quantify the temporal relationships between frames captured by CNN-based action models. We then conduct comprehensive experiments and in-depth analysis to provide a better understanding of how temporal modeling is affected.
  arXiv  Detail & Related papers  (2022-04-25T19:06:48Z)
• Temporal Knowledge Graph Reasoning with Low-rank and Model-agnostic Representations [1.8262547855491458]
  We introduce Time-LowFER, a family of parameter-efficient and time-aware extensions of the low-rank tensor factorization model LowFER. Noting several limitations in current approaches to represent time, we propose a cycle-aware time-encoding scheme for time features. We implement our methods in a unified temporal knowledge graph embedding framework, focusing on time-sensitive data processing.
  arXiv  Detail & Related papers  (2022-04-10T22:24:11Z)
• Self-Attention Neural Bag-of-Features [103.70855797025689]
  We build on the recently introduced 2D-Attention and reformulate the attention learning methodology. We propose a joint feature-temporal attention mechanism that learns a joint 2D attention mask highlighting relevant information.
  arXiv  Detail & Related papers  (2022-01-26T17:54:14Z)
• Deep Graph Memory Networks for Forgetting-Robust Knowledge Tracing [5.648636668261282]
  We propose a novel knowledge tracing model, namely emphDeep Graph Memory Network (DGMN) In this model, we incorporate a forget gating mechanism into an attention memory structure in order to capture forgetting behaviours. This model has the capability of learning relationships between latent concepts from a dynamic latent concept graph.
  arXiv  Detail & Related papers  (2021-08-18T12:04:10Z)
• On the Post-hoc Explainability of Deep Echo State Networks for Time Series Forecasting, Image and Video Classification [63.716247731036745]
  echo state networks have attracted many stares through time, mainly due to the simplicity and computational efficiency of their learning algorithm. This work addresses this issue by conducting an explainability study of Echo State Networks when applied to learning tasks with time series, image and video data. Specifically, the study proposes three different techniques capable of eliciting understandable information about the knowledge grasped by these recurrent models.
  arXiv  Detail & Related papers  (2021-02-17T08:56:33Z)
• Behavior Priors for Efficient Reinforcement Learning [97.81587970962232]
  We consider how information and architectural constraints can be combined with ideas from the probabilistic modeling literature to learn behavior priors. We discuss how such latent variable formulations connect to related work on hierarchical reinforcement learning (HRL) and mutual information and curiosity based objectives. We demonstrate the effectiveness of our framework by applying it to a range of simulated continuous control domains.
  arXiv  Detail & Related papers  (2020-10-27T13:17:18Z)
• Dynamic Knowledge embedding and tracing [18.717482292051788]
  We propose a novel approach to knowledge tracing that combines techniques from matrix factorization with recent progress in recurrent neural networks (RNNs) The proposed emphDynEmb framework enables the tracking of student knowledge even without the concept/skill tag information.
  arXiv  Detail & Related papers  (2020-05-18T21:56:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.