Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Urmărirea Cunoștințelor× | Analiza învățării× | Programare neliniară× | |
|---|---|---|---|
| Domeniu≠ | Analitică educațională | Analitică educațională | Optimizare |
| Familie≠ | Machine learning | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1994 | 2011 | 2006 |
| Autorul original≠ | Albert Corbett & John Anderson | George Siemens & Phil Long | Jorge Nocedal & Stephen Wright |
| Tip≠ | Probabilistic student modeling | data-driven educational process pipeline | Continuous mathematical optimization |
| Sursa seminală≠ | 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 ↗ | Siemens, G., & Long, P. (2011). Penetrating the fog: Analytics in learning and education. EDUCAUSE Review, 46(5), 30–40. link ↗ | Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1 |
| Denumiri alternative | BKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzleme | Educational Data Mining, Academic Analytics, Learning Data Analytics, Öğrenme Analitiği | NLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama |
| Înrudite | 3 | 3 | 3 |
| Rezumat≠ | 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. | Learning Analytics is the measurement, collection, analysis, and reporting of data about learners and their contexts, with the purpose of understanding and optimizing learning and the environments in which it occurs. Formally introduced by George Siemens and Phil Long in 2011, the approach draws on data generated in digital learning environments to provide educators, institutions, and learners with evidence-based feedback for improving educational outcomes. | Nonlinear programming (NLP) is a branch of mathematical optimization concerned with problems in which the objective function or at least one constraint is nonlinear. Formalized comprehensively by Jorge Nocedal and Stephen Wright in their seminal 2006 text, NLP encompasses gradient-based algorithms — including sequential quadratic programming (SQP), interior-point methods, and quasi-Newton approaches — for finding locally or globally optimal solutions to continuous decision problems arising across engineering, economics, and the physical sciences. |
| ScholarGateSet de date ↗ |
|
|
|