mlsanityData to 14 Oct 2026

Constructing a personalized learning path using genetic algorithms approach

arXiv 2104.11276 ↗First posted 22 Apr 2021cs.AI cs.HC cs.NEcited by 3

Not on the map. Why?

Abstract (arXiv)

A substantial disadvantage of traditional learning is that all students follow the same learning sequence, but not all of them have the same background of knowledge, the same preferences, the same learning goals, and the same needs. Traditional teaching resources, such as textbooks, in most cases pursue students to follow fixed sequences during the learning process, thus impairing their performance. Learning sequencing is an important research issue as part of the learning process because no fixed learning paths will be appropriate for all learners. For this reason, many research papers are focused on the development of mechanisms to offer personalization on learning paths, considering the learner needs, interests, behaviors, and abilities. In most cases, these researchers are totally focused on the student's preferences, ignoring the level of difficulty and the relation degree that exists between various concepts in a course. This research paper presents the possibility of constructing personalized learning paths using genetic algorithm-based model, encountering the level of difficulty and relation degree of the constituent concepts of a course. The experimental results shows that the genetic algorithm is suitable to generate optimal learning paths based on learning object difficulty level, duration, rating, and relation degree between each learning object as elementary parts of the sequence of the learning path. From these results compared to the quality of the traditional learning path, we observed that even the quality of the weakest learning path generated by our GA approach is in a favor compared to quality of the traditional learning path, with a difference of 3.59%, while the highest solution generated in the end resulted 8.34% in favor of our proposal compared to the traditional learning paths.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 1 of its 24 references that are in the map. First posted on arXiv 22 Apr 2021.

Builds on

1 of 24 references.

References · 1

  1. 2020A Tutorial on Learning With Bayesian Networkscited by 57

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.