ScholarGate
어시스턴트

방법 비교

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

지식 추적×학습 분석×비선형 계획법×
분야교육 분석학교육 분석학최적화
계열Machine learningProcess / pipelineProcess / pipeline
기원 연도199420112006
창시자Albert Corbett & John AndersonGeorge Siemens & Phil LongJorge Nocedal & Stephen Wright
유형Probabilistic student modelingdata-driven educational process pipelineContinuous 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. 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
별칭BKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzlemeEducational Data Mining, Academic Analytics, Learning Data Analytics, Öğrenme AnalitiğiNLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama
관련333
요약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.
ScholarGate데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

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

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