ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

학습 곡선 (연습의 동력 법칙)×지식 추적×비선형 계획법×
분야교육 분석학교육 분석학최적화
계열Regression modelMachine learningProcess / pipeline
기원 연도193619942006
창시자Theodore WrightAlbert Corbett & John AndersonJorge Nocedal & Stephen Wright
유형Power-law regression modelProbabilistic student modelingContinuous mathematical optimization
원전Wright, 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
별칭Power 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
관련333
요약The 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.
ScholarGate데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Learning Curve · Knowledge Tracing · Nonlinear Programming. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare