{"type":"ScholarlyArticle","title":"Ceteris Paribus Preference Elicitation with Predictive Guarantees","authors":[{"name":"Yannis Dimopoulos","slug":"yannis-dimopoulos","given":"Yannis","family":"Dimopoulos","affiliation":"Department of Computer Science , University of Cyprus CY-1678 Nicosia , Cyprus"},{"name":"Loizos Michael","slug":"loizos-michael","given":"Loizos","family":"Michael","affiliation":"Department of Computer Science , University of Cyprus CY-1678 Nicosia , Cyprus"},{"name":"Fani Athienitou","slug":"fani-athienitou","given":"Fani","family":"Athienitou","affiliation":"Department of Computer Science , University of Cyprus CY-1678 Nicosia , Cyprus"}],"abstract":"CP-networks have been proposed as a simple and intuitive graphical tool for representing conditional ceteris paribus preference statements over the values of a set of variables. While the problem of reasoning with CP-networks has been receiving some attention, there are very few works that address the problem of learning CP-networks. In this work we investigate the task of learning CP-networks, given access to a set of pairwise comparisons. We first prove that the learning problem is intractable, even under several simplifying assumptions. We then present an algorithm that, under certain assumptions about the observed pairwise comparisons, identifies a CP-network that entails these comparisons. We finally show that the proposed algorithm is a PAC-learner, and, thus, that the CP-networks it induces accurately predict the user's preferences on previously unseen situations.Yannis Dimopoulos, Loizos Michael, Fani Athienitou","doi":null,"url":"https://ijcai.org/proceedings/2009/313","pdf":"https://ijcai.org/proceedings/2009/0313.pdf","markdown":"https://ijcai.org/proceedings/2009/313.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/313","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":313,"pages":{"first":1890,"last":1894},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Arvind et al., 2007] V. Arvind, J. Köbler, and W. Lindner. Parameterized learnability of k-juntas and related prob- lems. In ALT'07, 2007.","title":"Parameterized learnability of k-juntas and related problems","authors":"V Arvind, J Köbler, W Lindner","year":"2007","venue":"ALT'07","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aspvall et al., 1979] B. Aspvall, M. Plass, and R. Tarjan. A linear-time algorithm for testing the truth of certain quan- tified boolean formulas. Inform. Proc. Letters, 8, 1979.","title":"A linear-time algorithm for testing the truth of certain quantified boolean formulas","authors":"B Aspvall, M Plass, R Tarjan","year":"1979","venue":"Inform. Proc. Letters","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Athienitou and Dimopoulos, 2007] F. Athienitou and Y. Di- mopoulos. Learning CP-networks: A preliminary investi- gation. In M-Pref'07, 2007.","title":"Learning CP-networks: A preliminary investigation","authors":"F Athienitou, Y Dimopoulos","year":"2007","venue":"M-Pref'07","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Blum, 2003] A. Blum. Learning a function of r relevant variables (open problem). In COLT'03, 2003.","title":"Learning a function of r relevant variables (open problem)","authors":"A Blum","year":"2003","venue":"COLT'03","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Boutilier et al., 2003] C. Boutilier, R. Brafman, C. Domsh- lak, H. Hoos, and D. Poole. CP-nets: A tool for represent- ing and reasoning with conditional ceteris paribus prefer- ence statements. Journal of AI Research, 2003.","title":"CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements","authors":"C Boutilier, R Brafman, C Domshlak, H Hoos, D Poole","year":"2003","venue":"Journal of AI Research","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Brafman et al., 2006] R. Brafman, C. Domshlak, and S. Shimony. On graphical modeling of preference and im- portance. Journal of AI Research, 25, 2006.","title":"On graphical modeling of preference and importance","authors":"R Brafman, C Domshlak, S Shimony","year":"2006","venue":"Journal of AI Research","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brinker et al., 2006] K. Brinker, J. Fürnkranz, and E. Hüllermeier. A unified model for multilabel clas- sification and ranking. In ECAI'06, 2006.","title":"A unified model for multilabel classification and ranking","authors":"K Brinker, J Fürnkranz, E Hüllermeier","year":"2006","venue":"ECAI'06","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cohen et al., 1999] W. Cohen, R. Schapire, and Y. Singer. Learning to order things. Journal of AI Research, 10, 1999.","title":"Learning to order things","authors":"W Cohen, R Schapire, Y Singer","year":"1999","venue":"Journal of AI Research","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kearns and Vazirani, 1994] M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. The MIT Press, Cambridge, Massachusetts, U.S.A., 1994.","title":"An Introduction to Computational Learning Theory","authors":"M J Kearns, U V Vazirani","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Lang and Mengin, 2008] J. Lang and J. Mengin. Learn- ing preference relations over combinatorial domains. In NMR'08, 2008.","title":"Learning preference relations over combinatorial domains","authors":"J Lang, J Mengin","year":"2008","venue":"NMR'08","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Valiant, 1984] L. G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134-1142, 1984.","title":"A theory of the learnable","authors":"L G Valiant","year":"1984","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}