MétaCan
Menu
Back to cohort
Record W3006185405 · doi:10.1109/ictai.2019.00217

Some Improvements of Deep Knowledge Tracing

2019· article· en· W3006185405 on OpenAlexaff
Ange Tato, Roger Nkambou

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicIntelligent Tutoring Systems and Adaptive Learning
Canadian institutionsUniversité du Québec à Montréal
Fundersnot available
KeywordsComputer scienceTracingDomain knowledgeArtificial intelligenceCeiling (cloud)Deep learningGeneralizationMachine learningDomain (mathematical analysis)Dynamic Bayesian networkBayesian networkEngineeringProgramming language

Abstract

fetched live from OpenAlex

Deep Knowledge Tracing (DKT), along with other machine learning approaches, are biased toward data used during the training step. Thus, for problems where we have few amounts of data for training, the generalization power will be low, the models will tend to give good results on classes containing many examples and poor results on those with few examples. Theses problems are frequent in educational data where for example, there are skills that are very difficult (floor) or very easy to master (ceiling). There will be less data on students that correctly answered questions related to difficult knowledge and that incorrectly answered questions related to knowledge easy to master. In that case, the DKT is unable to correctly predict the student's answers to questions associated with those skills. To improve the DKT, we penalize the model using a 'cost-sensitive' technique. To overcome the problem of the few amounts of data, we propose a hybrid model combining the DKT and expert knowledge. Thus, the DKT is combined with a Bayesian Network (built from domain experts) by using the attention mechanism. The resulting model can accurately track knowledge of students in Logic-Muse Intelligent Tutoring System (ITS), compared to the BKT and the original DKT.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.004
Open science0.0030.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0030.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.248
Teacher spread0.234 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations6
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicIntelligent Tutoring Systems and Adaptive LearningFrench-language works237,207