ScholarGate
Trợ lý

So sánh phương pháp

Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.

Đường cong học tập (Luật lũy thừa của thực hành)×Knowledge Tracing×Lập trình phi tuyến×
Lĩnh vựcPhân tích giáo dụcPhân tích giáo dụcTối ưu hóa
HọRegression modelMachine learningProcess / pipeline
Năm ra đời193619942006
Người khởi xướngTheodore WrightAlbert Corbett & John AndersonJorge Nocedal & Stephen Wright
LoạiPower-law regression modelProbabilistic student modelingContinuous mathematical optimization
Công trình gốcWright, T. P. (1936). Factors affecting the cost of airplanes. Journal of the Aeronautical Sciences, 3(4), 122–128. 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 ↗Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1
Tên gọi khácPower Law of Practice, Experience Curve, Wright's Law, Öğrenme EğrisiBKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzlemeNLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama
Liên quan333
Tóm tắtThe learning curve models how performance improves predictably as cumulative experience accumulates. Formalized by Theodore Wright in 1936 using aircraft manufacturing data, it expresses the relationship between the number of practice trials (or production units) and the time or cost per unit as a power-law function. It is widely applied in educational psychology, industrial engineering, health professions training, and human factors research whenever repeated task execution is the mechanism of skill acquisition.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.
ScholarGateBộ dữ liệu
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: Learning Curve · Knowledge Tracing · Nonlinear Programming. Truy cập ngày 2026-06-17 từ https://scholargate.app/vi/compare