The complexity of learning separable ceteris paribus preferences

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 848-853

  Lang, Jérôme ^a   Mengin, Jérôme ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CETERIS PARIBUS; COMPLEXITY RESULTS; DEPENDENCE STRUCTURES; LEARNING PREFERENCES; MULTI-ATTRIBUTES; PREFERENCE RELATION;

ARTIFICIAL INTELLIGENCE;

EID: 77956035254     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. F. Athienitou and Y. Dimopoulos. Learning CP-networks: a preliminary investigation. In Proc. 3rd Multidisciplinary Work. on Advances in Preference Handling (PREF'07), 2007.
2. C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. JAIR, 21:135-191, 2004.
3. W. J. Bradley, J. K. Hodge, and D.M. Kilgour. Separable discrete preferences. Mathematical Social Science, 49(3):335-353, 2005.
4. R. Brafman, C. Domshlak, and S. Shimony. On graphical modeling of preference and importance. JAIR, 25:389-424, 2006.
5. D. Braziunas and C. Boutilier. Elicitation of factored utilities. AI Magazine, 29 (4), 2008.
6. L. Chen and P. Pu. Survey of preference elicitation methods. Tech. Rep. 200467, EPFL, 2004.
7. W. Cohen, R. Schapire, and Y. Singer. Learning to order things. JAIR, 10:243-270, 1999.
8. J. Dombi, C. Imreh, and N. Vincze. Learning lexicographic orders. Eur. J. of Operational Research, 183:748-756, 2007.
9. C. Domshlak and T. Joachims. Efficient and non-parametric reasoning over user preferences. User Modeling and User-Adapted Interaction (UMUAI), 17(1-2):41-69, April 2007.
10. J. Doyle, Y. Shoham, and M. Wellman. A logic of relative desire (preliminary report). In Proc. ISMIS '91, 16-31. 1991.
11. C. Gonzales and P. Perny. GAI networks for utility elicitation. In Proc. KR'04, pages 224-233. AAAI Press, 2004.
12. V. Ha and P. Haddawy. Problem-focused incremental elicitation of multi-attribute utility models. In Proc. UAI-97, pages 215-222, 1997.
13. E. Hüllermeier, J. Fürnkranz, W. Cheng, and K. Brinker. Label ranking by learning pairwise preferences. AIJ, 172:1897-1917, 2008.
14. R. Keeney and H. Raiffa. Decision with Multiple Objectives: Preferences and Value Trade-offs. Wiley, 1976.
15. F. Koriche and B. Zanuttini. Learning conditional preference networks with queries, 2009. In Proc. IJCAI'09.
16. M. Sachdev. On learning of ceteris paribus preference theories. Master's thesis, Graduate Faculty of North Carolina State University, 2007.
17. M. Schmitt and L. Martignon. On the complexity of learning lexicographic strategies. J. Mach. Learn. Res., 7:55-83, 2006.
18. P. Viappiani, B. Faltings, and P. Pu. Preference-based search using example-critiquing with suggestions. JAIR, 27:465-503, 2006.
19. N. Wilson. Extending CP-Nets with Stronger Conditional Preference Statements. In AAAI-04, pages 735-741, 2004.
20. F. Yaman, T. Walsh, M. Littman, and M. desJardins. Democratic approximation of lexicographic preference models. In Proc. ICML '08, pages 1200-1207, 2008.