View article

In e-learning, one of the main difficulties is recommending learning materials that users can complete on time. It becomes more challenging when users cannot devote enough time to learn the entire course. In this paper, we describe two approaches to maximize users’ scores for a course while satisfying their time constraints. These approaches recommend successful paths based on the available time and knowledge background of users. We first briefly explain a method that has a similar goal to our method, and highlight its drawbacks. We then describe our proposal, which works based on a two-layered course graph (lesson and Learning Object (LO) layers; a lesson includes a few LO). Initially, our method uses the Depth First Search algorithm (DFS) to find all lesson sequences in the graph that start by a lesson (opted by a user). It then assigns LO for lessons of paths and estimates their score and time. Finally, a …