{"type":"ScholarlyArticle","title":"The Complexity of Learning Separable ceteris paribus Preferences","authors":[{"name":"Jérôme Lang","slug":"jerome-lang","given":"Jérôme","family":"Lang","affiliation":""},{"name":"Jérôme Mengin","slug":"jerome-mengin","given":"Jérôme","family":"Mengin","affiliation":""}],"abstract":"We address the problem of learning preference relations on multi-attribute (or combinatorial) domains. We do so by making a very simple hypothesis about the dependence structure between attributes that the preference relation enjoys, namely separability (no preferential dependencies between attributes). Given a set of examples consisting of comparisons between alternatives, we want to output a separable CP-net, consisting of local preferences on each of the attributes, that fits the examples. We consider three forms of compatibility between a CP-net and a set of examples, and for each of them we give useful characterizations as well as complexity results.Jérôme Lang, Jérôme Mengin","doi":null,"url":"https://ijcai.org/proceedings/2009/145","pdf":"https://ijcai.org/proceedings/2009/0145.pdf","markdown":"https://ijcai.org/proceedings/2009/145.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/145","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":145,"pages":{"first":848,"last":852},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}