On using markov chain to evidence the learning structures and difficulty levels of one digit multiplication

Behnam Taraghi, Martin Ebner, Anna Saranti, Martin Schön
{"title":"On using markov chain to evidence the learning structures and difficulty levels of one digit multiplication","authors":"Behnam Taraghi, Martin Ebner, Anna Saranti, Martin Schön","doi":"10.1145/2567574.2567614","DOIUrl":null,"url":null,"abstract":"Understanding the behavior of learners within learning applications and analyzing the factors that may influence the learning process play a key role in designing and optimizing learning applications. In this work we focus on a specific application named \"1x1 trainer\" that has been designed for primary school children to learn one digit multiplications. We investigate the database of learners' answers to the asked questions (N > 440000) by applying the Markov chains. We want to understand whether the learners' answers to the already asked questions can affect the way they will answer the subsequent asked questions and if so, to what extent. Through our analysis we first identify the most difficult and easiest multiplications for the target learners by observing the probabilities of the different answer types. Next we try to identify influential structures in the history of learners' answers considering the Markov chain of different orders. The results are used to identify pupils who have difficulties with multiplications very soon (after couple of steps) and to optimize the way questions are asked for each pupil individually.","PeriodicalId":178564,"journal":{"name":"Proceedings of the Fourth International Conference on Learning Analytics And Knowledge","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Conference on Learning Analytics And Knowledge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2567574.2567614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

Abstract

Understanding the behavior of learners within learning applications and analyzing the factors that may influence the learning process play a key role in designing and optimizing learning applications. In this work we focus on a specific application named "1x1 trainer" that has been designed for primary school children to learn one digit multiplications. We investigate the database of learners' answers to the asked questions (N > 440000) by applying the Markov chains. We want to understand whether the learners' answers to the already asked questions can affect the way they will answer the subsequent asked questions and if so, to what extent. Through our analysis we first identify the most difficult and easiest multiplications for the target learners by observing the probabilities of the different answer types. Next we try to identify influential structures in the history of learners' answers considering the Markov chain of different orders. The results are used to identify pupils who have difficulties with multiplications very soon (after couple of steps) and to optimize the way questions are asked for each pupil individually.
用马尔可夫链证明一位数乘法的学习结构和难度
了解学习者在学习应用程序中的行为,分析可能影响学习过程的因素,对设计和优化学习应用程序起着关键作用。在这项工作中,我们专注于一个名为“1x1训练器”的特定应用程序,该应用程序是为小学生学习一位数乘法而设计的。我们利用马尔可夫链研究了学习者对提问问题(N > 440000)的答案数据库。我们想了解学习者对已经提出的问题的回答是否会影响他们对随后提出的问题的回答方式,如果会,影响到什么程度。通过我们的分析,我们首先通过观察不同答案类型的概率来确定目标学习者最难和最容易的乘法。接下来,我们尝试在考虑不同阶的马尔可夫链的学习者回答历史中识别有影响的结构。结果被用来识别那些在乘法方面有困难的学生(在几个步骤之后),并优化每个学生单独提问的方式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信