Show simple item record

The Complexity of Learning Separable ceteris paribus Preferences

dc.contributor.authorLang, Jérôme
dc.contributor.authorMengin, Jérôme
HAL ID: 184956
dc.date.accessioned2010-04-09T10:41:19Z
dc.date.available2010-04-09T10:41:19Z
dc.date.issued2009
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3902
dc.language.isoenen
dc.subjectPreference relations
dc.subject.ddc006.3en
dc.titleThe Complexity of Learning Separable ceteris paribus Preferences
dc.typeCommunication / Conférence
dc.description.abstractenWe address the problem of learning preference relations on multi-attribute (or combinatorial) domains.We do so by making a very simple hypothesis aboutthe dependence structure between attributes thatthe preference relation enjoys, namely separability(no preferential dependencies between attributes).Given a set of examples consisting of comparisonsbetween alternatives, we want to output a separableCP-net, consisting of local preferences on each ofthe attributes, that fits the examples. We considerthree forms of compatibility between a CP-net anda set of examples, and for each of them we give useful characterizations as well as complexity results.
dc.identifier.citationpages848-853
dc.relation.ispartoftitleIJCAI-09, 21st International Joint Conference on Artificial Intelligence
dc.relation.ispartofpublnameAAAI Press / IJCAI
dc.relation.ispartofpublcityPalo Alto (USA)
dc.relation.ispartofdate2009
dc.description.sponsorshipprivateouien
dc.subject.ddclabelIntelligence artificielleen
dc.relation.confcountryUNITED STATES
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2017-01-06T18:48:59Z


Files in this item

Thumbnail
Name:
publi1178.pdf
Size:
166.8Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record