.png){kind=icon}
返回
Optimal Knowledge Component Extracting Model for Knowledge-Concept Graph Completion in Education
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3244614.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As people have become accustomed to non-face-to-face education because of the COVID-19 pandemic, adaptive and personalized learning is being emphasized in the field of education. Learning paths suitable for each student may differ from those normally provided by teachers. To support coaching based on the concept of adaptive learning, the first step is to discover the relationships among the concepts in the curriculum provided in the form of a knowledge graph. In this study, feature reduction for the target knowledge-concept was first performed using Elastic Net and Random Forest algorithms, which are known to have the best performance in machine learning. Deep knowledge tracing (DKT) in the form of a dual-net, which is more efficient because of the already slimmer data, was then applied to increase the accuracy of feature selection. The new approach, termed the optimal knowledge component extracting (OKCE) model, was proven to be superior to a feature reduction approach using only Elastic Net and Random Forest using both open and commercial datasets. Finally, the OKCE model showed a meaningful knowledge-concept graph that could help teachers in adaptive and personalized learning.
Keyword:
Feature extraction
Deep learning
Random forests
Mathematical models
Correlation
Analytical models
Predictive models
Deep learning based knowledge tracing (DKT)
dual-net
elastic net
feature selection
knowledge component (KC)
least absolute shrinkage and selection operator (LASSO)
random forest (RF)
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Nucleation and initial growth of copper electrodeposits under galvanostatic conditions恒电流条件下铜电沉积的成核和初始生长
.png){kind=icon}
PREAI
分享收藏
分享收藏分享收藏
查看更多内容