{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/28439"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/28439","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"APOT : automatic path optimizing for traits","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Lin, Thomas, 1981-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Harold Abelson and Dick K.P. Yue."],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004","date_published":"2004","updated_at":"2026-07-22T22:21:10Z","subjects":["Electrical Engineering and Computer Science."],"languages":["en_US"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/28439","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Harold Abelson and Dick K.P. Yue."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Lin, Thomas, 1981-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-09-26T20:28:37Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-09-26T20:28:37Z"]},{"key":"dc:date.issued","label":"Date","values":["2004"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/28439"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 77-78)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["APOT : automatic path optimizing for traits"]}]}],"canonical_facts":{"dc:contributor.advisor":["Harold Abelson and Dick K.P. Yue."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Lin, Thomas, 1981-"],"dc:date.accessioned":["2005-09-26T20:28:37Z"],"dc:date.available":["2005-09-26T20:28:37Z"],"dc:date.issued":["2004"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 77-78)."],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/28439"],"dc:language.iso":["en_US"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["APOT : automatic path optimizing for traits"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:10Z"}