Show simple item record

Design Preference Elicitation, Identification and Estimation.

dc.contributor.authorRen, Yien_US
dc.date.accessioned2012-06-15T17:31:16Z
dc.date.availableNO_RESTRICTIONen_US
dc.date.available2012-06-15T17:31:16Z
dc.date.issued2012en_US
dc.date.submitteden_US
dc.identifier.urihttps://hdl.handle.net/2027.42/91578
dc.description.abstractUnderstanding user preference has long been a challenging topic in the design research community. Econometric methods have been adopted to link design and market, achieving design solutions sound from both engineering and business perspectives. This approach, however, only refines existing designs from revealed or stated preference data. What is needed for generating new designs is an environment for concept exploration and a channel to collect and analyze preferences on newly-explored concepts. This dissertation focuses on the development of querying techniques that learn and extract individual preferences efficiently. Throughout the dissertation, we work in the context of a human-computer interaction where in each iteration the subject is asked to choose preferred designs out of a set. The computer learns from the subject and creates the next query set so that the responses from the subject will yield the most information on the subject's preferences. The challenges of this research are: (1) To learn subject preferences within short interactions with enormous candidate designs; (2) To facilitate real-time interactions with efficient computation. Three problems are discussed surrounding how information-rich queries can be made. The major effort is devoted to preference elicitation, where we discuss how to locate the most preferred design of a subject. Using efficient global optimization, we develop search algorithms that combine exploration of new concepts and exploitation of existing knowledge, achieving near-optimal solutions with a small number of queries. For design demonstration, the elicitation algorithm is incorporated with an online 3D car modeler. The effectiveness of the algorithm is confirmed by real user tests on finding car models close to the users' targets. In preference identification, we consider designs as binary labeled, and the objective is to classify preferred designs from not-preferred ones. We show that this classification problem can be formulated and solved by the same active learning technique used for preference estimation, where the objective is to estimate a preference function. Conceptually, this dissertation discusses how to extract preference information effectively by asking relevant but not redundant questions during an interaction.en_US
dc.language.isoen_USen_US
dc.subjectPreference Elicitationen_US
dc.subjectMachine Learningen_US
dc.subjectGlobal Optimizationen_US
dc.subjectActive Learningen_US
dc.titleDesign Preference Elicitation, Identification and Estimation.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineMechanical Engineeringen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.contributor.committeememberPapalambros, Panos Y.en_US
dc.contributor.committeememberGonzalez, Richard D.en_US
dc.contributor.committeememberKikuchi, Noboruen_US
dc.contributor.committeememberMichailidis, Georgeen_US
dc.subject.hlbsecondlevelMechanical Engineeringen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/91578/1/yiren_1.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.