| Téléchargement | - Voir le manuscrit accepté : A binary integer programming model for global optimization of learning path discovery (PDF, 718 Kio)
|
|---|
| Auteur | Rechercher : Belacel, Nabil1; Rechercher : Durand, Guillaume1; Rechercher : Laplante, François |
|---|
| Affiliation | - Conseil national de recherches du Canada. Technologies de l'information et des communications
|
|---|
| Format | Texte, Article |
|---|
| Conférence | G-EDM workshop, July 4-7, 2014, London, UK |
|---|
| Résumé | This paper introduces a method based on graph theory and operations research techniques to optimize learning path discovery. In this method, learning objects are considered as nodes and competencies as vertices of a learning graph. A first step consists in reducing the solution space by obtaining an induced subgraph H. In a second step, the search of an optimal learning path in H is considered as a binary integer programming problem which we propose to solve using an exact method based on the well-known branch-and-bound algorithm. The method detailed in the paper takes into account the prerequisite and gained competencies as constraints of the optimization problem by minimizing the total competencies needed to reach the learning objective. |
|---|
| Date de publication | 2014-07-07 |
|---|
| Dans | |
|---|
| Langue | anglais |
|---|
| Publications évaluées par des pairs | Oui |
|---|
| Numéro NPARC | 21275389 |
|---|
| Exporter la notice | Exporter en format RIS |
|---|
| Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
|---|
| Identificateur de l’enregistrement | 273ea05b-5e9d-49bd-800a-6f529a3967e0 |
|---|
| Enregistrement créé | 2015-06-25 |
|---|
| Enregistrement modifié | 2020-06-04 |
|---|
