Presentation 2002/9/13
Proposition of a Learning Task Sequencing Method in the Multi-Value Graph
Daisuke UCHIDA, Hitoshi SASAKI, Makoto TAKEYA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The task sequencing method is one of techniques for sequencing learning items in learning process based on graph representation. The traditional methods are applied to a graph with binary relations between individual items, but can be never applied to a graph with multi-valued relations. This paper presents a new task sequencing method which can be used for multi-valued graphs. Furthermore, in order to verify usefulness of our new method, this paper discusses on the comparison of our new method with our conventional methods. To be concrete, this paper shows comparison results among these methods using the example of the IRS graph obtained by a test for the unit "multiplication". As a result, we discuss on difference of sequences among these methods and effectiveness of our new method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) task sequencing / multi-value graph / one dimension
Paper # ET2002-36
Date of Issue

Conference Information
Committee ET
Conference Date 2002/9/13(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) Proposition of a Learning Task Sequencing Method in the Multi-Value Graph
Sub Title (in English)
Keyword(1) task sequencing
Keyword(2) multi-value graph
Keyword(3) one dimension
1st Author's Name Daisuke UCHIDA
1st Author's Affiliation Faculty of Engineering, Takushoku University()
2nd Author's Name Hitoshi SASAKI
2nd Author's Affiliation Faculty of Engineering, Takushoku University
3rd Author's Name Makoto TAKEYA
3rd Author's Affiliation Faculty of Engineering, Takushoku University
Date 2002/9/13
Paper # ET2002-36
Volume (vol) vol.102
Number (no) 330
Page pp.pp.-
#Pages 6
Date of Issue