Presentation | 2001/12/8 Composition of Learning Group by GA Akinori IWASAKI, Isao MIYAJI, Takayuki OUE, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | It is an important aim to make a closely united class in elementary school. Consisting learning groups in the class, it is more desirable that friendship among learning groups is stronger. The friendship is represented as a sociomatrix. The elements mean the strength in which a pupil select the other in the class. We apply a random search and a genetic algorithm to the problem of consisting learning groups. The problem is to partition pupils in the class to some groups in order to maximize the sum of strength of selction. We show that the genetic algorithm provides better solutions than random algorithem. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | learning group / strength of selction / search / genetic algorithm / random search |
Paper # | ET2001-76 |
Date of Issue |
Conference Information | |
Committee | ET |
---|---|
Conference Date | 2001/12/8(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Educational Technology (ET) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Composition of Learning Group by GA |
Sub Title (in English) | |
Keyword(1) | learning group |
Keyword(2) | strength of selction |
Keyword(3) | search |
Keyword(4) | genetic algorithm |
Keyword(5) | random search |
1st Author's Name | Akinori IWASAKI |
1st Author's Affiliation | Information Processing Center, Okayana University of Science() |
2nd Author's Name | Isao MIYAJI |
2nd Author's Affiliation | Faculty of Informatics, Okayama University of Science |
3rd Author's Name | Takayuki OUE |
3rd Author's Affiliation | Faculty of Informatics, Okayama University of Science |
Date | 2001/12/8 |
Paper # | ET2001-76 |
Volume (vol) | vol.101 |
Number (no) | 506 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |