Learning preference relations over combinatorial domains
Lang, Jérôme; Mengin, Jérôme (2008), Learning preference relations over combinatorial domains, Preference Learning ECML/PKDD-08 Workshop, Anvers, BELGIUM
TypeCommunication / Conférence
Conference titlePreference Learning ECML/PKDD-08 Workshop
MetadataShow full item record
Abstract (EN)We address the problem of learning preference relations over multiattribute(or combinatorial) domains. We do so by making hypotheses about thedependence structure between attributes that the preference relation enjoys. Thefirst hypothesis we consider is the simplest one, namely, separability (no dependencesbetween attributes: the preference over the values of each attribute is independentof the values of other attributes); then we consider the more general casewhere the dependence structure takes the form of an acyclic graph. In all cases,what we want to learn is a set of local preference relations (or equivalently, a CPnet)rather than a fully specified preference relation. We consider three forms ofconsistency between a CP-net and a set of examples, and for two of them we givean exact characterization in the case of separability, as well as complexity results.
Subjects / KeywordsPreference relations
Showing items related by title and author.