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 条
  • [31] Comparison of Dijkstra's Algorithm and Dynamic Programming Method in Finding Shortest Path for Order Picker in a Warehouse
    Nordin, Noraimi Azlin Mohd
    Omar, Mohd
    Sharif, S. Sarifah Radiah
    4TH INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES (ICMS4): MATHEMATICAL SCIENCES: CHAMPIONING THE WAY IN A PROBLEM BASED AND DATA DRIVEN SOCIETY, 2017, 1830
  • [32] Centerline algorithm for virtual endoscopy based on chamfer distance transform and Dijkstra's single source shortest path algorithm
    Blezek, DJ
    Robb, RA
    MEDICAL IMAGING 1999: PHYSIOLOGY AND FUNCTION FROM MULTIDIMENSIONAL IMAGES, 1999, 3660 : 225 - 233
  • [33] A Novel Solution of Dijkstra's Algorithm for Shortest Path Routing with Polygonal Obstacles in Wireless Networks Using Fuzzy Mathematics
    Ghosh, Dhruba
    Kumar, Sunil
    Bhulania, Paurush
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION TECHNOLOGIES, IC3T 2015, VOL 2, 2016, 380 : 489 - 497
  • [34] The shortest path problem on chola period built temples with Dijkstra's algorithm in intuitionistic triangular neutrosophic fuzzy graph
    Kalaiarasi, K.
    Divya, R.
    Mishra, Vishnu Narayan
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, (49): : 324 - 344
  • [35] Analyzing students’ performance in computerized formative assessments to optimize teachers’ test administration decisions using deep learning frameworks
    Jinnie Shin
    Fu Chen
    Chang Lu
    Okan Bulut
    Journal of Computers in Education, 2022, 9 : 71 - 91
  • [36] Analyzing students' performance in computerized formative assessments to optimize teachers' test administration decisions using deep learning frameworks
    Shin, Jinnie
    Chen, Fu
    Lu, Chang
    Bulut, Okan
    JOURNAL OF COMPUTERS IN EDUCATION, 2022, 9 (01) : 71 - 91
  • [37] An Experimental Comparison of Implementations of Dijkstra's Single Source Shortest Path Algorithm Using Different Priority Queues Data Structures
    Andreiana, Andrei-Daniel
    Badica, Costin
    Ganea, Eugen
    2020 24TH INTERNATIONAL CONFERENCE ON SYSTEM THEORY, CONTROL AND COMPUTING (ICSTCC), 2020, : 124 - 129
  • [38] Research on Traversal Path Planning and Collaborative Scheduling for Corn Harvesting and Transportation in Hilly Areas Based on Dijkstra's Algorithm and Improved Harris Hawk Optimization
    Liu, Huanyu
    Luo, Jiahao
    Zhang, Lihan
    Yu, Hao
    Liu, Xiangnan
    Wang, Shuang
    AGRICULTURE-BASEL, 2025, 15 (03):