Article Preview
Top2. Existing Adaptive Content Optimization Approaches
In this section, we present the optimization problem in the field of adaptive hypermedia applications. We base our presentation on the study of some adaptive content optimization approaches to compare with our proposed solution.
2.1. GAITS Approach
GAITS was one of the first educational hypermedia systems using genetic optimization algorithms. Supervised education techniques are used, the teacher assigns an educational goal for each student before training begins (Quafafou, 1993).
In order to provide optimal educational content, the tutor interacts with the learner using predefined dialogues. These dialogs consist of a header and a body. The header contains the preliminary knowledge required to use this dialogue as a candidate of the current lesson, a learning level and a learning strategy to present the lesson. The body represents the educational material that defines the interactions (exhibition, question / answer, games, etc.) (Mock, 1996).
2.2. Approach by Ant Colony
Several research studies have used algorithms ant colonies (a class of evolutionary algorithms recently proposed for difficult optimization problems). The goal was to track the learner when navigating through the links courses and study his footsteps.
With a simple decomposition of content in sections and units, the ant colony algorithm could solve the problem of guiding users on their path. The main mechanisms used in this algorithm is the propagation of information (the effectiveness of the teaching of content units, relevance of bows, and the tendency of users) accumulated by the system through user navigation between units content. This information's communication mechanism described the operation mode of the ant colony. The objective of this switching device is to guide the user to the most consistent unit. (Haddi et al., 2008).
Another approach consists to assimilate the user as the ant (Dahbi et al., 2014). Modeling content in the form of a directed graph allows applying this algorithm. Each node of the graph represents a concept, each directed arc represents the opportunity to spend this concept to another. The user can then be assimilated to an ant looking for the best way to achieve the goal., passing the tests related to the final lesson of this course. The best way forward is built gradually through the pheromone left by the user throughout its course, failures and successes. Such approaches are used for groups of users by recording track of users during navigation in the set of content.