• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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
cp-net_da2pl.pdf (321.7Kb)
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
10.1007/s40070-017-0070-3
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

Related items

Showing items related by title and author.

  • Thumbnail
    Query-based learning of acyclic conditional preference networks from noisy data 
    Labernia, Fabien; Yger, Florian; Mayag, Brice; Atif, Jamal (2016) Communication / Conférence
  • Thumbnail
    Online learning of acyclic conditional preference networks from noisy data 
    Labernia, Fabien; Zanuttini, Bruno; Mayag, Brice; Yger, Florian; Atif, Jamal (2017) Communication / Conférence
  • Thumbnail
    Algorithmes efficaces pour l’apprentissage de réseaux de préférences conditionnelles à partir de données bruitées 
    Labernia, Fabien (2018-09-27) Thèse
  • Thumbnail
    Graph-based Clustering under Differential Privacy 
    Pinot, Rafael; Morvan, Anne; Yger, Florian; Gouy-Pailler, Cédric; Atif, Jamal (2018) Communication / Conférence
  • Thumbnail
    Uplift Modeling from Separate Labels 
    Yamane, Ikko; Yger, Florian; Atif, Jamal; Sugiyama, Masashi (2018) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo