【24h】

Automatic Adaptive Sequencing in a Webgame

机译:网络游戏中的自动自适应排序

获取原文

摘要

Intelligent tutoring systems can improve student outcomes, but developing such systems typically requires significant expertise or prior data of students using the system. In this work we propose a new approach for automatically adaptively sequencing practice activities for an individual student. Our approach builds on progress for automatically constructing curriculum graphs and advancing a student through a graph using a multi-armed bandit algorithm. These approaches have relatively few hyperparameters and are designed to work well given limited or no prior data. We evaluate our method, which can be applied to a diverse range of domains, in our online game for basic Korean language learning and found promising initial results. Compared to an expert-designed fixed ordering, our adaptive algorithm had a statistically significant positive effect on a learning efficiency metric defined using in game performance.
机译:智能教学系统可以提高学生的学习成绩,但开发此类系统通常需要大量专业知识或使用该系统的学生的先前数据。在这项工作中,我们提出了一种新的方法自动自适应排序的实践活动为一个单独的学生。我们的方法建立在自动构建课程图和使用多臂bandit算法推进学生通过图的过程的基础上。这些方法具有相对较少的超参数,并且在有限或没有先验数据的情况下可以很好地工作。我们在我们的韩语基础学习在线游戏中评估了我们的方法,该方法可应用于多种领域,并发现了有希望的初步结果。与专家设计的固定顺序相比,我们的自适应算法对使用游戏性能定义的学习效率指标具有统计显著的积极影响。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号