Algorithms

Páginas: 21 (5243 palabras) Publicado: 20 de noviembre de 2012
 

49

Comparison of Different Machine Learning Algorithms for the Initialization of Student Knowledge Level in a Learner Model-Based Adaptive E-Learning System
ROBERT O. OBOKO, PETER W. WAGACHA, & ELIJAH OMWENGA* School of Computing and Informatics, University of Nairobi ARNO LIBOTTON Faculty of Psychology and Educational Sciences, Free University of Brussels___________________________________________________________________________
Abstract: Web-based learning systems give students the freedom to determine what to study based on each individual student’s learning goals. These systems support students in constructing their own knowledge for solving problems at hand. However, in the absence of instructors, students often need to be supported as they learn in ways that are tailoredto suit a specific student. Adaptive web-based learning systems are suited to such situations. In order for an adaptive learning system to be able to provide learning support, it needs to build a model of each individual student and then to use the attribute values for each student as stored in the student model to determining the kind of learning support that is suitable for each student.Examples of such attributes are student knowledge level, learning styles, student errors committed during learning, the student’s program of study, gender and number of programming languages learned by the student of programming. There are two important issues about the use of student models. Firstly, how to initialize the attributes in the student models and secondly, how to update the attribute valuesof the student model as students interact with the learning system. With regard to initialization of student models, one of the approaches used is to input into a machine learning algorithm attribute values of students who are already using the system and who are similar (hence called neighbors) to the student whose model is being initialized. The algorithm will use these values to predict initialvalues for the attributes of a new student. Similarity among students is often expressed as the distance from one student to another. This distance is often determined using a heterogeneous function of Euclidean and Overlap measures (HOEM). This paper reports the results of an investigation on how HOEM compares to two different variations of Value Difference Metric (VDM) combined with theEuclidean measure (HVDM) using different numbers of neighbors. An adaptive web-based learning system teaching object oriented programming was used. HOEM was found to be more accurate than the two variations of HVDM. Categories and Subject Descriptions: H.5.2 [Information Interfaces and Presentation]: User Interfaces – User Centered Design; H.5.4 [Information Interfaces and Presentation]:Hypertext/Hypermedia-Navigation, User issues; I.2.6 [Artificial Intelligence]: Learning – Concept learning; Induction; K.3.1 [Computers and Education]: Computer Uses in Education – Distance Learning, Computer Assisted Instruction (CAI) General Terms: Algorithms, Human Factors, Experimentation, Measurement Additional Key Words: Learner modeling, initialization, web-based learning, nearest neighbors, overlapmeasure, knowledge level, object oriented programming, value difference metric. _______________________________________________________________________________ IJCIR Reference Format:

                                                            
* Robert O. Oboko, Peter W. Wagacha, & Elijah Omwenga, School of Computing and Informatics, University of Nairobi{roboko, wagacha, muthoni,eomwenga}@uonbi.ac.ke; Arno Libotton, Faculty of Psychology and Educational Sciences, Free University of Brussels, arno.libotton@skynet.be

“Permission to make digital/hard copy of part of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date of...
Leer documento completo

Regístrate para leer el documento completo.

Estos documentos también te pueden resultar útiles

  • A case for multicast algorithms
  • Matlab For Numerical Algorithms
  • Algorithms
  • Numerical Algorithms For Evaluating Sobol
  • Introduction to algorithms
  • Introduction to algorithms
  • Algorithms for distributed constraint satisfaction
  • Hybrid Algorithms For The Constraint Satisfaction Problem

Conviértase en miembro formal de Buenas Tareas

INSCRÍBETE - ES GRATIS