2015 IEEE Frontiers in Education Conference (FIE) 2015
DOI: 10.1109/fie.2015.7344325
|View full text |Cite
|
Sign up to set email alerts
|

An automation of the course design based on mathematical modeling and genetic algorithms

Abstract: This work in progress describes a technique of course design in the form of learning objects (LO) sequences. We defined the distance between LOs (metric of learning objects space based on revised Blooms Taxonomy) and used it to design an objective function. This function is a sum of distances between LOs in the given sequence learning prerequisites of a course and its learning outcomes. In addition, the function contains penalties for the violations of the learning sequence, when, for example, one or more lear… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…This type of teaching strategy will not help students who believe that learning is learner-centered. Dukhanov et al (2015) and Shmelev et al (2015), both works of the same user, use two different variants of the genetic algorithm to generate learning sequences. A course (sequence of LOs) is presented as an individual with one chromosome, and each gene is an LO.…”
Section: Review Of Learning Path Generation Methodsmentioning
confidence: 99%
“…This type of teaching strategy will not help students who believe that learning is learner-centered. Dukhanov et al (2015) and Shmelev et al (2015), both works of the same user, use two different variants of the genetic algorithm to generate learning sequences. A course (sequence of LOs) is presented as an individual with one chromosome, and each gene is an LO.…”
Section: Review Of Learning Path Generation Methodsmentioning
confidence: 99%
“…Genetic Algorithm (GA) is a metaheuristic method which is famous because it has good performance for various types of optimization problems. There have been many GA studies in the CS domain including [8]- [11].…”
Section: Introductionmentioning
confidence: 99%