เปรียบเทียบวิธี

	Knowledge Tracing	การโปรแกรมเชิงเส้นไม่ตรง
สาขาวิชา	การวิเคราะห์การศึกษา	การหาค่าเหมาะที่สุด
ตระกูล	Machine learning	Process / pipeline
ปีกำเนิด	1994	2006
ผู้ริเริ่ม	Albert Corbett & John Anderson	Jorge Nocedal & Stephen Wright
ประเภท	Probabilistic student modeling	Continuous mathematical optimization
แหล่งต้นตำรับ	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.	Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1
ชื่อเรียกอื่น	BKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzleme	NLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama
ที่เกี่ยวข้อง	3	3
สรุป	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.	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.