Learning Lexicographic Preference Trees From Positive Examples

This paper considers the task of learning the preferences of users on a combinatorial set of alternatives, as it can be the case for example with online configurators. In many settings, what is available to the learner is a set of positive examples of alternatives that have been selected during past interactions. We propose to learn a model of the users' preferences that ranks previously chosen alternatives as high as possible. In this paper, we study the particular task of learning conditional lexicographic preferences. We present an algorithm to learn several classes of lexicographic preference trees, prove convergence properties of the algorithm, and experiment on both synthetic data and on a real-world bench in the domain of recommendation in interactive configuration.

[1]  Thorsten Joachims,et al.  Optimizing search engines using clickthrough data , 2002, KDD.

[2]  R. Jackson.  Inequalities , 2007, Algebra for Parents.

[3]  Nic Wilson,et al.  Conditional lexicographic orders in constraint satisfaction problems , 2009, Ann. Oper. Res..

[4]  Miroslaw Truszczynski,et al.  Learning Partial Lexicographic Preference Trees over Combinatorial Domains , 2015, AAAI.

[5]  Craig Boutilier,et al.  CP-nets: a tool for represent-ing and reasoning with conditional ceteris paribus state-ments , 2004 .

[6]  Niall M. Fraser.  Applications of preference trees , 1993, Proceedings of IEEE Systems Man and Cybernetics Conference - SMC.

[7]  B. Kahn,et al.  Variety for sale: Mass customization or mass confusion? , 1998 .

[8]  Yann Chevaleyre,et al.  Learning conditionally lexicographic preference relations , 2010, ECAI.

[9]  Peter A. Flach,et al.  A Simple Lexicographic Ranker and Probability Estimator , 2007, ECML.

[10]  Craig Boutilier,et al.  Local Utility Elicitation in GAI Models , 2005, UAI.

[11]  Yoram Singer,et al.  An Efficient Boosting Algorithm for Combining Preferences by , 2013 .

[12]  Lirong Xia,et al.  Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains , 2012, CP.

[13]  Eyke Hüllermeier,et al.  Learning Conditional Lexicographic Preference Trees , 2014 .

[14]  Bruno Zanuttini,et al.  Learning Conditional Preference Networks with Queries , 2009, IJCAI.

[15]  Nic Wilson,et al.  An Efficient Upper Approximation for Conditional Preference , 2006, ECAI.

[16]  Paolo Viappiani,et al.  Preference-based Search using Example-Critiquing with Suggestions , 2006, J. Artif. Intell. Res..

[17]  Michael Schmitt,et al.  On the Complexity of Learning Lexicographic Strategies , 2006, J. Mach. Learn. Res..

[18]  Thomas J. Walsh,et al.  Democratic approximation of lexicographic preference models , 2011, Artif. Intell..

[19]  Eyke Hüllermeier,et al.  Lexicographic preferences for predictive modeling of human decision making: A new machine learning method with an application in accounting , 2017, Eur. J. Oper. Res..

[20]  G Gigerenzer,et al.  Reasoning the fast and frugal way: models of bounded rationality. , 1996, Psychological review.

[21]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[22]  József Dombi,et al.  Learning lexicographic orders , 2007, Eur. J. Oper. Res..

[23]  Niall M. Fraser.  Ordinal preference representations , 1994 .

[24]  Patrice Perny,et al.  GAI Networks for Utility Elicitation , 2004, KR.