Toward Case-Based Preference Elicitation: Similarity Measures on Preference Structures

While decision theory provides an appealing normative framework for representing rich preference structures, eliciting utility or value functions typically incurs a large cost. For many applications involving interactive systems this overhead precludes the use of formal decision-theoretic models of preference. Instead of performing elicitation in a vacuum, it would be useful if we could augment directly elicited preferences with some appropriate default information. In this paper we propose a case-based approach to alleviating the preference elicitation bottleneck. Assuming the existence of a population of users from whom we have elicited complete or incomplete preference structures, we propose eliciting the preferences of a new user interactively and incrementally, using the closest existing preference structures as potential defaults. Since a notion of closeness demands a measure of distance among preference structures, this paper takes the first step of studying various distance measures over fully and partially specified preference structures. We explore the use of Euclidean distance, Spearman's footrule, and define a new measure, the probabilistic distance. We provide computational techniques for all three measures.

[1]  Peter Winkler,et al.  Counting linear extensions is #P-complete , 1991, STOC '91.

[2]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[3]  G. Brightwell,et al.  Counting linear extensions , 1991 .

[4]  L. J. Savage,et al.  The Foundations of Statistics , 1955 .

[5]  R. Graham,et al.  Spearman's Footrule as a Measure of Disarray , 1977 .

[6]  Lise Getoor,et al.  Utility Elicitation as a Classiication Problem , 1998 .

[7]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[8]  Peter Haddawy,et al.  Problem-Focused Incremental Elicitation of Multi-Attribute Utility Models , 1997, UAI.

[9]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[10]  Bradley N. Miller,et al.  GroupLens: applying collaborative filtering to Usenet news , 1997, CACM.

[11]  Lotfi A. Zadeh,et al.  Similarity relations and fuzzy orderings , 1971, Inf. Sci..

[12]  Bradley N. Miller,et al.  Applying Collaborative Filtering to Usenet News , 1997 .

[13]  Greg Linden,et al.  Interactive Assessment of User Preference Models: The Automated Travel Assistant , 1997 .

[14]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[15]  Martin E. Dyer,et al.  Faster random generation of linear extensions , 1999, SODA '98.

[16]  L. Khachiyan,et al.  On the conductance of order Markov chains , 1991 .

[17]  A. Tynan,et al.  Market Segmentation , 2018, Entrepreneurial Management Theory and Practice.

[18]  C. Spearman ‘FOOTRULE’ FOR MEASURING CORRELATION , 1906 .

[19]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[20]  S. Ovchinnikov Similarity relations, fuzzy partitions, and fuzzy orderings , 1991 .

[21]  Seinosuke Toda On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[22]  Yuval Shahar,et al.  Utility Elicitation as a Classification Problem , 1998, UAI.

[23]  David M. Kreps Notes On The Theory Of Choice , 1988 .