Thumbnail

Query-based learning of acyclic conditional preference networks from contradictory preferences

Labernia, Fabien; Yger, Florian; Mayag, Brice; Atif, Jamal (2017), Query-based learning of acyclic conditional preference networks from contradictory preferences, EURO Journal on Decision Processes, 6, p. 39-59. 10.1007/s40070-017-0070-3

View/Open
Type
Article accepté pour publication ou publié
Date
2017
Journal name
EURO Journal on Decision Processes
Volume
6
Publisher
Springer
Pages
39-59
Publication identifier
Metadata
Show full item record
Author(s)
Labernia, Fabien
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Yger, Florian cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Mayag, Brice
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Atif, Jamal
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
Conditional preference networks (CP-nets) provide a compact and intuitive graphical tool to represent the preferences of a user. However, learning such a structure is known to be a difficult problem due to its combinatorial nature. We propose, in this paper, a new, efficient, and robust query-based learning algorithm for acyclic CP-nets. In particular, our algorithm takes into account the contradictions between multiple users’ preferences by searching in a principled way the variables that affect the preferences. We provide complexity results of the algorithm, and demonstrate its efficiency through an empirical evaluation on synthetic and on real databases.
Subjects / Keywords
Query-based learning algorithm; Contradictory preferences; Preference learning; Conditional preference networks
JEL
C44 - Operations Research; Statistical Decision Theory