Successful students' exam-period Markov chains show the lowest graph complexity, with failing students' chains the highest¶
Claim · All claims
Evidence · 1 study · associationalr1·q2
Currency · newest study 2023 · not yet checked against its sources · not reviewed by a person
Subclaims¶
Reading the evidence codes
q is the design tier, i the impact, n the sample, and the kind with its r
the rigour judged within that kind: what each code means.
This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.
q2 i? The number of nodes, edges and complexity measure are lowest for the Successful group and highest for the Failing group (complexity 0.1844 vs 0.7474). → Jakub Kuzilek 2023
Evidence¶
Jakub Kuzilek 2023¶
Jakub Kuzilek, Zdenek Zdrahal, Jonas Vaclavek, Viktor Fuglik, Jan Skocilas, Annika Wolff. (2023). First-Year Engineering Students' Strategies for Taking Exams. International Journal of Artificial Intelligence in Education. https://doi.org/10.1007/s40593-022-00303-4
q2 · i? · associational · r1
Observational analysis of exam-attempt logs of 311 students, with Markov chain statistics per performance group reported in Table 5: nodes 48/84/114, edges 83/134/206, complexity "0.1844 0.2896 0.7474" for Successful, Passing and Failing groups respectively.
"We can observe that the number of nodes is the lowest for the students in the Successful group and the highest in the performance group of Failing students. The same observation can be made for the graph edges and the complexity"
Discussion¶
Related Claims¶
- Graph similarity is highest between successful and passing students (0.997) and lowest between successful and failing students (0.954) — related
- Failing students are predominantly inactive in the first two weeks of the exam period — related
Page metadata
| Field | Value |
|---|---|
type |
claim |
id |
successful-students-lowest-markov-complexity |
title |
Successful students' exam-period Markov chains show the lowest graph complexity, with failing students' chains the highest |
description |
Successful students' exam-period Markov chains show the lowest graph complexity, with failing students' chains the highest |
status |
review |
evidence_strength |
moderate |
newest_evidence |
2023 |
generated |
by process:wiki-ingest on 2026-10-28 |
trust |
unverified — no one has confirmed this page's content |
sources |
1 — jakub-kuzilek-2023 |
Frontmatter is the page's machine-readable record — see the Schema & Guide.