. . .

About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors

Departments:
- Image Processing and Computer Graphics
- Technical Informatics
- Foundations of Computer Science
- Computer Algorithms and Artificial Intelligence
- Computational Optimization
- Software Engineering
- Research Group on Artificial Intelligence

[University of Szeged]
Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 19, Number 3, 2010>>> flag_HUMagyarul

Modeling a Domain in a Tutorial-like System Using Learning Automata

  B. John Oommen and M. Khaled Hashem


Abstract (in LaTeX format)

  The aim of this paper is to present a novel approach to model a knowledge domain for teaching material in a Tutorial-like system. In this approach, the Tutorial-like system is capable of presenting teaching material within a Socratic model of teaching. The corresponding questions are of a multiple choice type, in which the complexity of the material increases in difficulty. This enables the Tutorial-like system to present the teaching material in different chapters, where each chapter represents a level of difficulty that is harder than the previous one. We attempt to achieve the entire learning process using the Learning Automata (LA) paradigm. In order for the Domain model to possess an increased difficulty for the teaching Environment, we propose to correspondingly reduce the range of the penalty probabilities of all actions by incorporating a scaling factor mu. We show that such a scaling renders it more difficult for the Student to infer the correct action within the LA paradigm. To the best of our knowledge, the concept of modeling teaching material with increasing difficulty using a LA paradigm is unique. The main results we have obtained are that increasing the difficulty of the teaching material can affect the learning of Normal and Below-Normal Students by resulting in an increased learning time, but it seems to have no effect on the learning behavior of Fast Students. The proposed representation has been tested for different benchmark Environments, and the results show that the difficulty of the Environments can be increased by decreasing the range of the penalty probabilities. For example, for some Environments, decreasing the range of the penalty probabilities by 50% results in increasing the difficulty of learning for Normal Students by more than 60%.

  Kewords: domain modeling, tutorial-like systems, learning automata, modeling of adaptive systems.


Full text

 Available electronic editions: PDF.

 Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.


BibTeX entry

@article{Oommen:2010:ActaCybernetica,
author = {B. John Oommen and M. Khaled Hashem},
title = {Modeling a Domain in a Tutorial-like System Using Learning Automata},
journal = {Acta Cybernetica},
volume = {19},
number= {3},
pages = {635--653},
year = {2010},
abstract = {The aim of this paper is to present a novel approach to model a knowledge domain for teaching material in a Tutorial-like system. In this approach, the Tutorial-like system is capable of presenting teaching material within a Socratic model of teaching. The corresponding questions are of a multiple choice type, in which the complexity of the material increases in difficulty. This enables the Tutorial-like system to present the teaching material in different chapters, where each chapter represents a level of difficulty that is harder than the previous one. We attempt to achieve the entire learning process using the Learning Automata (LA) paradigm. In order for the Domain model to possess an increased difficulty for the teaching Environment, we propose to correspondingly reduce the range of the penalty probabilities of all actions by incorporating a scaling factor mu. We show that such a scaling renders it more difficult for the Student to infer the correct action within the LA paradigm. To the best of our knowledge, the concept of modeling teaching material with increasing difficulty using a LA paradigm is unique. The main results we have obtained are that increasing the difficulty of the teaching material can affect the learning of Normal and Below-Normal Students by resulting in an increased learning time, but it seems to have no effect on the learning behavior of Fast Students. The proposed representation has been tested for different benchmark Environments, and the results show that the difficulty of the Environments can be increased by decreasing the range of the penalty probabilities. For example, for some Environments, decreasing the range of the penalty probabilities by 50% results in increasing the difficulty of learning for Normal Students by more than 60%.},
keywords = {domain modeling, tutorial-like systems, learning automata, modeling of adaptive systems}
}

 

Webmaster:webmaster@inf.u-szeged.hu