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 条
  • [21] An improved weighted sum-fuzzy Dijkstra's algorithm for shortest path problem (iWSFDA)
    Dudeja, Chanchal
    Kumar, Pawan
    SOFT COMPUTING, 2022, 26 (07) : 3217 - 3226
  • [22] An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)
    Chanchal Dudeja
    Pawan Kumar
    Soft Computing, 2022, 26 : 3217 - 3226
  • [23] An Improved Dijkstra's Algorithm for Shortest Path Planning on 2D Grid Maps
    Li Wenzheng
    Liu Junjun
    Yao Shunli
    PROCEEDINGS OF 2019 IEEE 9TH INTERNATIONAL CONFERENCE ON ELECTRONICS INFORMATION AND EMERGENCY COMMUNICATION (ICEIEC 2019), 2019, : 438 - 441
  • [24] Dijkstra's algorithm for shortest path problem using bucket-heap data structure
    Lim, A
    Chong, OW
    COMPUTER APPLICATIONS IN INDUSTRY AND ENGINEERING, 2000, : 179 - 184
  • [25] REDUCED SOLUTION SET SHORTEST PATH PROBLEM: CAPTON ALGORITM WITH SPECIAL REFERENCE TO DIJKSTRA'S ALGORITHM
    Abbas, Qaiser
    Hussain, Qasim
    Zia, Tehseen
    Mansoor, Arfan
    MALAYSIAN JOURNAL OF COMPUTER SCIENCE, 2018, 31 (03) : 175 - 187
  • [26] On the Study of Shortest-path Problem on Coal-transportation Networks using Dijkstra's Algorithm
    Chang, Hao-Yen
    Wang, Ping-Feng
    Chen, Hon-Chan
    Chen, Ye-Zheng
    Chen, Da-Ren
    2019 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW), 2019,
  • [27] Finding Shortest Path in Road Networks Based on Jam-Distance Graph and Dijkstra's Algorithm
    Ali, Sarah Fouad
    Abdulrazzaq, Musaab Riyadh
    Gaata, Methaq Talib
    NEXT GENERATION OF INTERNET OF THINGS, 2023, 445 : 469 - 480
  • [28] Comparison of Temporal Difference Learning Algorithm and Dijkstra's Algorithm for Robotic Path Planning
    Nair, Devika S.
    Supriya, P.
    PROCEEDINGS OF THE 2018 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2018, : 1619 - 1624
  • [29] Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
    Khachiyan, Leonid
    Gurvich, Vladimir
    Zhao, Jihui
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 221 - 234
  • [30] Shortest Path Identification in Reconfigurable Microgrid Using Hybrid Bellman Ford-Dijkstra's Algorithm
    Swathika, O. V. Gnana
    Hemamalini, S.
    Mishra, Shivam
    Pophali, Sumedh Meher
    Barve, Nilay Alokkumar
    ADVANCED SCIENCE LETTERS, 2016, 22 (10) : 2932 - 2935