APOT : automatic path optimizing for traits
Name
57003369-MIT.pdf
Description
Full printable version
Size
7.74 MB
Format
Adobe PDF
Checksum (MD5)
c03fe585205da6ff8399174dcb7638b6
Author(s)
Lin, Thomas, 1981-
Advisor(s)
Harold Abelson and Dick K.P. Yue.
Alternative Title
Automatic path optimizing for traits
Date Issued
2004
Publisher
Massachusetts Institute of Technology
Abstract
This thesis considers the design of automated tutoring systems that customize teaching material to accommodate individual student learning styles. In particular, we consider the following problem: Begin with one or more presentations of a subject, and break them into fragments ("atoms") each expressing a single idea. Given information about an individual student's learning style, how can one select the optimal choice and sequence of atoms ("path of atoms") to create the most effective presentation for that student? We have implemented several algorithms that automatically create such paths, and we investigate the tradeoff between number of constraints imposed by the algorithms and the number of paths they can find. We have tested one of these algorithms ("partition search") in an experiment where student volunteers in computer science studied material about planning and artificial intelligence. The results of the experiment indicate that the algorithms can produce presentations that are effectively tailored to the different learning styles.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 77-78).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
