Learning Analytics and Computerized Formative Assessments: An Application of Dijkstra's Shortest Path Algorithm for Personalized Test Scheduling

被引:6
|
作者
Bulut, Okan [1 ]
Shin, Jinnie [2 ]
Cormier, Damien C. [3 ]
机构
[1] Univ Alberta, Ctr Res Appl Measurement & Evaluat, Edmonton, AB T6G 2G5, Canada
[2] Univ Florida, Coll Educ, Gainesville, FL 32611 USA
[3] Univ Alberta, Dept Educ Psychol, Edmonton, AB T6G 2G5, Canada
关键词
recommender system; shortest path; Dijkstra; reading; formative assessment; personalized learning; PROGRESS; SYSTEM;
D O I
10.3390/math10132230
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The use of computerized formative assessments in K-12 classrooms has yielded valuable data that can be utilized by learning analytics (LA) systems to produce actionable insights for teachers and other school-based professionals. For example, LA systems utilizing computerized formative assessments can be used for monitoring students' progress in reading and identifying struggling readers. Using such LA systems, teachers can also determine whether progress is adequate as the student works towards their instructional goal. However, due to the lack of guidelines on the timing, number, and frequency of computerized formative assessments, teachers often follow a one-size-fits-all approach by testing all students together on pre-determined dates. This approach leads to a rigid test scheduling that ignores the pace at which students improve their reading skills. In some cases, the consequence is testing that yields little to no useful data, while increasing the amount of instructional time that students miss. In this study, we propose an intelligent recommender system (IRS) based on Dijkstra's shortest path algorithm that can produce an optimal assessment schedule for each student based on their reading progress throughout the school year. We demonstrated the feasibility of the IRS using real data from a large sample of students in grade two (n = 668,324) and grade four (n = 727,147) who participated in a series of computerized reading assessments. Also, we conducted a Monte Carlo simulation study to evaluate the performance of the IRS in the presence of unusual growth trajectories in reading (e.g., negative growth, no growth, and plateau). Our results showed that the IRS could reduce the number of test administrations required at both grade levels by eliminating test administrations in which students' reading growth did not change substantially. In addition, the simulation results indicated that the IRS could yield robust results with meaningful recommendations under relatively extreme growth trajectories. Implications for the use of recommender systems in K-12 education and recommendations for future research are discussed.
引用
收藏
页数:19
相关论文
共 38 条
  • [1] An Intelligent Recommender System for Personalized Test Administration Scheduling With Computerized Formative Assessments
    Bulut, Okan
    Cormier, Damien C.
    Shin, Jinnie
    FRONTIERS IN EDUCATION, 2020, 5
  • [2] The Improved Dijkstra's Shortest Path Algorithm and Its Application
    Wang Shu-Xi
    2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 1186 - 1190
  • [3] A parallelization of Dijkstra's shortest path algorithm
    Crauser, A
    Mehlhorn, K
    Meyer, U
    Sanders, P
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 722 - 731
  • [4] Parallel Bidirectional Dijkstra's Shortest Path Algorithm
    Vaira, Gintaras
    Kurasova, Olga
    DATABASES AND INFORMATION SYSTEMS VI: SELECTED PAPERS FROM THE NINTH INTERNATIONAL BALTIC CONFERENCE (DB&IS 2010), 2011, 224 : 422 - 435
  • [5] Micro crack detection with Dijkstra’s shortest path algorithm
    Christina Gunkel
    Alexander Stepper
    Arne C. Müller
    Christine H. Müller
    Machine Vision and Applications, 2012, 23 : 589 - 601
  • [6] Micro crack detection with Dijkstra's shortest path algorithm
    Gunkel, Christina
    Stepper, Alexander
    Mueller, Arne C.
    Mueller, Christine H.
    MACHINE VISION AND APPLICATIONS, 2012, 23 (03) : 589 - 601
  • [7] An improved Dijkstra's shortest path algorithm for sparse network
    Xu, M. H.
    Liu, Y. Q.
    Huang, Q. L.
    Zhang, Y. X.
    Luan, G. F.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 185 (01) : 247 - 254
  • [8] Building an intelligent recommendation system for personalized test scheduling in computerized assessments: A reinforcement learning approach
    Jinnie Shin
    Okan Bulut
    Behavior Research Methods, 2022, 54 : 216 - 232
  • [9] Building an intelligent recommendation system for personalized test scheduling in computerized assessments: A reinforcement learning approach
    Shin, Jinnie
    Bulut, Okan
    BEHAVIOR RESEARCH METHODS, 2022, 54 (01) : 216 - 232
  • [10] A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
    Peyer, Sven
    Rautenbach, Dieter
    Vygen, Jens
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 377 - 390