{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/37075"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/37075","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Clustered Naive Bayes","abstract":"Humans effortlessly use experience from related tasks to improve their performance at novel tasks. In machine learning, we are often confronted with data from \"related\" tasks and asked to make predictions for a new task. How can we use the related data to make the best prediction possible? In this thesis, I present the Clustered Naive Bayes classifier, a hierarchical extension of the classic Naive Bayes classifier that ties several distinct Naive Bayes classifiers by placing a Dirichlet Process prior over their parameters. A priori, the model assumes that there exists a partitioning of the data sets such that, within each subset, the data sets are identically distributed. I evaluate the resulting model in a meeting domain, developing a system that automatically responds to meeting requests, partially taking on the responsibilities of a human office assistant. The system decides, based on a learned model of the user's behavior, whether to accept or reject the request on his or her behalf. The extended model outperforms the standard Naive Bayes model by using data from other users to influence its predictions.","abstract_html":"Humans effortlessly use experience from related tasks to improve their performance at novel tasks. In machine learning, we are often confronted with data from "related" tasks and asked to make predictions for a new task. How can we use the related data to make the best prediction possible? In this thesis, I present the Clustered Naive Bayes classifier, a hierarchical extension of the classic Naive Bayes classifier that ties several distinct Naive Bayes classifiers by placing a Dirichlet Process prior over their parameters. A priori, the model assumes that there exists a partitioning of the data sets such that, within each subset, the data sets are identically distributed. I evaluate the resulting model in a meeting domain, developing a system that automatically responds to meeting requests, partially taking on the responsibilities of a human office assistant. The system decides, based on a learned model of the user's behavior, whether to accept or reject the request on his or her behalf. The extended model outperforms the standard Naive Bayes model by using data from other users to influence its predictions.","abstract_has_math":false,"creators":["Roy, Daniel Murphy"],"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":["Leslie Pack Kaelbling."],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006","date_published":"2006","updated_at":"2026-07-22T22:21:37Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"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/37075","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Leslie Pack Kaelbling."]},{"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":["Roy, Daniel Murphy"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2007-04-03T17:08:55Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2007-04-03T17:08:55Z"]},{"key":"dc:date.issued","label":"Date","values":["2006"]},{"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":["eng"]},{"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/37075"]}]},{"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, 2006.","Includes bibliographical references (leaves 71-73)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Humans effortlessly use experience from related tasks to improve their performance at novel tasks. In machine learning, we are often confronted with data from \"related\" tasks and asked to make predictions for a new task. How can we use the related data to make the best prediction possible? In this thesis, I present the Clustered Naive Bayes classifier, a hierarchical extension of the classic Naive Bayes classifier that ties several distinct Naive Bayes classifiers by placing a Dirichlet Process prior over their parameters. A priori, the model assumes that there exists a partitioning of the data sets such that, within each subset, the data sets are identically distributed. I evaluate the resulting model in a meeting domain, developing a system that automatically responds to meeting requests, partially taking on the responsibilities of a human office assistant. The system decides, based on a learned model of the user's behavior, whether to accept or reject the request on his or her behalf. The extended model outperforms the standard Naive Bayes model by using data from other users to influence its predictions."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Clustered Naive Bayes"]}]}],"canonical_facts":{"dc:contributor.advisor":["Leslie Pack Kaelbling."],"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":["Roy, Daniel Murphy"],"dc:date.accessioned":["2007-04-03T17:08:55Z"],"dc:date.available":["2007-04-03T17:08:55Z"],"dc:date.issued":["2006"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.","Includes bibliographical references (leaves 71-73)."],"dc:description.abstract":["Humans effortlessly use experience from related tasks to improve their performance at novel tasks. In machine learning, we are often confronted with data from \"related\" tasks and asked to make predictions for a new task. How can we use the related data to make the best prediction possible? In this thesis, I present the Clustered Naive Bayes classifier, a hierarchical extension of the classic Naive Bayes classifier that ties several distinct Naive Bayes classifiers by placing a Dirichlet Process prior over their parameters. A priori, the model assumes that there exists a partitioning of the data sets such that, within each subset, the data sets are identically distributed. I evaluate the resulting model in a meeting domain, developing a system that automatically responds to meeting requests, partially taking on the responsibilities of a human office assistant. The system decides, based on a learned model of the user's behavior, whether to accept or reject the request on his or her behalf. The extended model outperforms the standard Naive Bayes model by using data from other users to influence its predictions."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/37075"],"dc:language.iso":["eng"],"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":["Clustered Naive Bayes"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:37Z"}