AAAI Publications, Twenty-First International Joint Conference on Artificial Intelligence

Font Size: 
The Complexity of Learning Separable Ceteris Paribus Preferences
Jérôme Lang, Jérôme Mengin

Last modified: 2009-06-25

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.

Full Text: PDF