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-17に以下より取得 https://scholargate.app/ja/compare