Võrdle meetodeid
Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.
| Bayesian Knowledge Tracing× | Teadmiste jälgimine× | |
|---|---|---|
| Valdkond≠ | Education | Haridusanalüütika |
| Perekond | Machine learning | Machine learning |
| Tekkeaasta | 1994 | 1994 |
| Looja | Albert Corbett & John Anderson | Albert Corbett & John Anderson |
| Tüüp≠ | Two-state hidden Markov model of latent skill mastery from response sequences | Probabilistic student modeling |
| Algallikas | Corbett, A. T., & Anderson, J. R. (1994). Knowledge tracing: Modeling the acquisition of procedural knowledge. User Modeling and User-Adapted Interaction, 4(4), 253–278. DOI ↗ | Corbett, A. T., & Anderson, J. R. (1994). Knowledge tracing: Modeling the acquisition of procedural knowledge. User Modeling and User-Adapted Interaction, 4(4), 253–278. DOI ↗ |
| Rööpnimetused | BKT, Knowledge Tracing (Corbett-Anderson), Hidden Markov Knowledge Tracing, Skill Mastery Tracing | BKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzleme |
| Seotud | 3 | 3 |
| Kokkuvõte≠ | Bayesian knowledge tracing (BKT) is a model that estimates, after each problem a student attempts, the probability that the student has mastered the underlying skill. Introduced by Corbett and Anderson for intelligent tutoring systems, it is a two-state hidden Markov model: the latent variable is whether the skill is learned or not, and observed correct/incorrect responses update that latent state through Bayesian inference. With just four parameters — initial knowledge, learning, slip, and guess — BKT drives the mastery decisions that tell a tutor when a student can move on. | Knowledge Tracing (KT) is a student-modeling technique that estimates, at each moment in time, the probability that a learner has mastered a target knowledge component. Introduced by Corbett and Anderson in 1994, the classical Bayesian Knowledge Tracing (BKT) model treats skill acquisition as a two-state Hidden Markov Model driven by four interpretable parameters: prior knowledge, learning rate, slip, and guess. Deep variants (DKT, DKVMN, AKT) later replaced HMMs with recurrent and transformer architectures. |
| ScholarGateAndmestik ↗ |
|
|