{"type":"ScholarlyArticle","title":"Learning Conditional Preference Networks with Queries","authors":[{"name":"Frédéric Koriche","slug":"frederic-koriche","given":"Frédéric","family":"Koriche","affiliation":""},{"name":"Bruno Zanuttini","slug":"bruno-zanuttini","given":"Bruno","family":"Zanuttini","affiliation":""}],"abstract":"We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering with a binary-valued CP-net by guiding the user through a sequence of queries. Each example is a dominance test on some pair of outcomes. In this setting, we show that acyclic CP-nets are not learnable with equivalence queries alone, while they are learnable with the help of membership queries if the supplied examples are restricted to swaps. A similar property holds for tree CP-nets with arbitrary examples. In fact, membership queries allow us to provide attribute-efficient algorithms for which the query complexity is only logarithmic in the number of attributes. Such results highlight the utility of this model for eliciting CP-nets in large multi-attribute domains.Frederic Koriche, Bruno Zanuttini","doi":null,"url":"https://ijcai.org/proceedings/2009/319","pdf":"https://ijcai.org/proceedings/2009/0319.pdf","markdown":"https://ijcai.org/proceedings/2009/319.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/319","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":319,"pages":{"first":1930,"last":1934},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}