APOT : automatic path optimizing for traits

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.

Bibliographic Details
Main Author: Lin, Thomas, 1981-
Other Authors: Harold Abelson and Dick K.P. Yue.
Format: Thesis
Language:en_US
Published: Massachusetts Institute of Technology 2005
Subjects:
Online Access:http://hdl.handle.net/1721.1/28439
_version_ 1826194986574544896
author Lin, Thomas, 1981-
author2 Harold Abelson and Dick K.P. Yue.
author_facet Harold Abelson and Dick K.P. Yue.
Lin, Thomas, 1981-
author_sort Lin, Thomas, 1981-
collection MIT
description Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
first_indexed 2024-09-23T10:05:16Z
format Thesis
id mit-1721.1/28439
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T10:05:16Z
publishDate 2005
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/284392019-04-10T14:35:09Z APOT : automatic path optimizing for traits Automatic path optimizing for traits Lin, Thomas, 1981- Harold Abelson and Dick K.P. Yue. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. Includes bibliographical references (p. 77-78). 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. by Thomas Lin. M.Eng. 2005-09-26T20:28:37Z 2005-09-26T20:28:37Z 2004 2004 Thesis http://hdl.handle.net/1721.1/28439 57003369 en_US 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. http://dspace.mit.edu/handle/1721.1/7582 90 p. 5831991 bytes 5842017 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Lin, Thomas, 1981-
APOT : automatic path optimizing for traits
title APOT : automatic path optimizing for traits
title_full APOT : automatic path optimizing for traits
title_fullStr APOT : automatic path optimizing for traits
title_full_unstemmed APOT : automatic path optimizing for traits
title_short APOT : automatic path optimizing for traits
title_sort apot automatic path optimizing for traits
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/28439
work_keys_str_mv AT linthomas1981 apotautomaticpathoptimizingfortraits
AT linthomas1981 automaticpathoptimizingfortraits