Ceteris paribus preference elicitation with predictive guarantees

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 1890-1895

  Dimopoulos, Yannis ^a   Michael, Loizos ^a   Athienitou, Fani ^a  

^a UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

CETERIS PARIBUS; GRAPHICAL TOOLS; LEARNING PROBLEM; PAIR-WISE COMPARISON; PREFERENCE ELICITATION; PREFERENCE STATEMENTS; SIMPLIFYING ASSUMPTIONS; USER'S PREFERENCES;

ARTIFICIAL INTELLIGENCE;

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

References (11)

1. V. Arvind, J. Köbler, and W. Lindner. Parameterized learnability of k-juntas and related problems. In ALT'07, 2007.
2. B. Aspvall, M. Plass, and R. Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Proc. Letters, 8, 1979.
3. F. Athienitou and Y. Dimopoulos. Learning CP-networks: A preliminary investigation. In M-Pref'07, 2007.
4. A. Blum. Learning a function of r relevant variables (open problem). In COLT'03, 2003.
5. 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. Journal of AI Research, 2003.
6. R. Brafman, C. Domshlak, and S. Shimony. On graphical modeling of preference and importance. Journal of AI Research, 25, 2006.
7. K. Brinker, J. Fürnkranz, and E. Hüllermeier. A unified model for multilabel classification and ranking. In ECAI'06, 2006.
8. W. Cohen, R. Schapire, and Y. Singer. Learning to order things. Journal of AI Research, 10, 1999.
9. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. The MIT Press, Cambridge, Massachusetts, U.S.A., 1994.
10. J. Lang and J. Mengin. Learning preference relations over combinatorial domains. In NMR'08, 2008.
11. L. G. Valiant. A theory of the learnable. Comsmunications of the ACM, 27:1134-1142, 1984.