Metraipolis › archive › dc_89bc1537079b

Reliable Prerequisite-Aware Learning Path Recommendation under Uncertain Knowledge Structures: Long-Horizon Evaluation and Cross-Dataset Validation — arXiv:2611.09345

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.09345
License (as archived)
CC0-1.0
Archived
2026-11-09T22:34:59.188Z
SHA-256 of the archived text
926bc96407ba7cd91bbd8414de989a095d349e8b577acbee3d1aa56c0dd1d511
Stable URL of this page
https://metraipolis.com/documento/dc_89bc1537079b

How to cite

Reliable Prerequisite-Aware Learning Path Recommendation under Uncertain Knowledge Structures: Long-Horizon Evaluation and Cross-Dataset Validation — arXiv:2611.09345 — arXiv (en), https://arxiv.org/abs/2611.09345 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_89bc1537079b (Metraipolis archive dc_89bc1537079b, sha256 926bc96407ba7cd91bbd8414de989a095d349e8b577acbee3d1aa56c0dd1d511)
BibTeX
@misc{dc89bc1537079b,
  title = {Reliable Prerequisite-Aware Learning Path Recommendation under Uncertain Knowledge Structures: Long-Horizon Evaluation and Cross-Dataset Validation — arXiv:2611.09345},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.09345},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_89bc1537079b; sha256 926bc96407ba7cd91bbd8414de989a095d349e8b577acbee3d1aa56c0dd1d511},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09345. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Learning-path recommendation often depends on knowledge and prerequisite structures whose reliability is uncertain, while high accuracy in predicting the next resource does not necessarily establish reliable long-horizon path behaviour. This study develops a reliability-oriented prerequisite-aware framework that jointly examines immediate next-resource ranking, uncertain prerequisite structures, hard, soft and hybrid constraint semantics, graph robustness, and autoregressive path generation under course-level confirmatory evaluation and independent cross-dataset validation. Development used 3,187 MOOCCubeX courses, followed by a frozen confirmatory evaluation on 541 held-out courses and 37,747 transitions. The primary MOOCCubeX task is structural and course-prefix-conditioned rather than learner-personalised. Junyi provides independent structure-/hierarchy-aware external validation, uses hierarchy metadata rather than an explicit prerequisite graph and is not a zero-shot transfer setting. On the frozen MOOCCubeX evaluation, XGBoost pairwise was the strongest observed immediate ranker, with mean reciprocal rank (MRR) of 0.9048, whereas the proposed prerequisite-aware graph model achieved 0.7707. In the controlled graph-variant development ablation, the no-graph condition produced the strongest immediate ranking result, and immediate prediction showed strong dependence on permitted title/path-similarity information. Autoregressive evaluation exposed path properties not captured by one-step ranking. On Junyi, Markov achieved the strongest observed MRR of 0.4453, compared with 0.3954 for the proposed graph model, with metric-specific differences across ranking measures. Overall, immediate predictive accuracy, prerequisite-structure reliability, and long-horizon path quality should be treated as complementary rather than interchangeable evaluation dimensions in educational recommendation.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2611.09345 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:30:47.326Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).