<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06104460</id>
  <dt>a</dt>
  <an>06104460</an>
  <augroup>
    <au>Koriche, Fr\'ed\'eric</au>
  </augroup>
  <ti>Relational networks of conditional preferences. (Extended abstract).</ti>
  <so>Muggleton, Stephen H. (ed.) et al., Inductive logic programming. 21st international conference, ILP 2011, Windsor Great Park, UK, July 31 -- August 3, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31950-1/pbk). Lecture Notes in Computer Science 7207. Lecture Notes in Artificial Intelligence, 26-32 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-31951-8_6</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Like relational probabilistic models, the need for relational preference models naturally arises in real-world applications involving multiple, heterogeneous, and richly interconnected objects. On the one hand, relational preferences should be represented into statements which are natural for human users to express. On the other hand, relational preference models should be endowed with a structure that supports tractable forms of reasoning and learning. This paper introduces the framework of conditional preference relational networks (CPR-nets), that maintains the spirit of the popular ``CP-nets'' by expressing relational preferences in a natural way using the ceteris paribus semantics. We show that acyclic CPR-nets support tractable inference for optimization and ranking tasks. In addition, we show that in the online learning model, tree-structured CPR-nets are efficiently learnable from both optimization tasks and ranking tasks. Our results are corroborated with experiments on a large-scale movie recommendation dataset.</ab>
    <rv></rv>
  </abgroup>
</item>