Oommen John B.; Hashem M. Khaled: Modeling a domain in a tutorial-like system using learning automata. In: Acta cybernetica, (19) 3. pp. 635-653. (2010)
Előnézet |
Cikk, tanulmány, mű
Oommen_2010_ActaCybernetica.pdf Letöltés (241kB) | Előnézet |
Absztrakt (kivonat)
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 μ. 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%.
| Mű típusa: | Cikk, tanulmány, mű |
|---|---|
| Rovatcím: | Regular papers |
| Befoglaló folyóirat/kiadvány címe: | Acta cybernetica |
| Dátum: | 2010 |
| Kötet: | 19 |
| Szám: | 3 |
| ISSN: | 0324-721X |
| Oldalak: | pp. 635-653 |
| Nyelv: | angol |
| Kiadás helye: | Szeged |
| Befoglaló mű URL: | http://acta.bibl.u-szeged.hu/38529/ |
| Kulcsszavak: | Számítástechnika, Automaták |
| Megjegyzések: | Bibliogr.: p. 650-653. ; összefoglalás angol nyelven |
| Szakterület: | 01. Természettudományok 01. Természettudományok > 01.02. Számítás- és információtudomány |
| Feltöltés dátuma: | 2016. okt. 15. 12:24 |
| Utolsó módosítás: | 2022. jún. 17. 11:11 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12884 |
 |
Tétel nézet |
