شماره ركورد كنفرانس :
347
عنوان مقاله :
A Longest Common Subsequence based Genetic Algorithm for Courseware Design
پديدآورندگان :
Barati Jozan M. Mahdi نويسنده , taghiyareh fatemeh نويسنده
تعداد صفحه :
7
كليدواژه :
Learning object , Longest common subsequence , Courseware design , personalization
عنوان كنفرانس :
مجموعه مقالات هفتمين كنفرانس ملي و چهارمين كنفرانس بين المللي يادگيري و آموزش الكترونيكي
زبان مدرك :
فارسی
چكيده فارسي :
Personalizing learning is one of the high priority tasks in e-learning. Because of the tremendous importance of Learning Object (LO) in learning process, the attention of many researchers has been attracted to the personalization of LOs. The two main entities in learning are students and educational resources, so the educational activities should give high priority to these entities. In this study, a genetic based algorithm for personalizing the educational slides as an important learning material in traditional and e-learning environments is introduced. Slides and relations between them are showed in form of a graph. The proposed algorithm is applicable to all types of LOs. To evaluate the proposed method, the required data were collected with questionnaires from 36 students that enrolled in Bio Computing course. Analysis of the results shows that the proposed algorithm has been very successful in personalizing the educational slides. It can use to enhance the teaching and learning in traditional and electronic learning environments.
شماره مدرك كنفرانس :
3742337
سال انتشار :
1391
از صفحه :
1
تا صفحه :
7
سال انتشار :
0
لينک به اين مدرک :
بازگشت