Learning conditional preference networks
From MaRDI portal
Publication:991013
DOI10.1016/j.artint.2010.04.019zbMath1205.68291OpenAlexW2038431270MaRDI QIDQ991013
Bruno Zanuttini, Frédéric Koriche
Publication date: 2 September 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00485498/file/kz10.pdf
preference elicitationattribute-efficient learningconditional preference network (\(CP\)-net)query-directed learning
Related Items (4)
Possibilistic preference networks ⋮ Relational networks of conditional preferences ⋮ Aggregating preferences represented by conditional preference networks ⋮ The complexity of exact learning of acyclic conditional preference networks from swap examples
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classic learning
- On the limits of proper learnability of subclasses of DNF formulas
- Lower bound methods and separation results for on-line learning models
- Learning conjunctions of Horn clauses
- Attribute-efficient learning in query and mistake-bound models
- Learning closed Horn expressions
- Asking questions to minimize errors
- Structural results about on-line learning models with and without queries
- Learning function-free Horn expressions
- Queries and concept learning
- Graphically structured value-function compilation
- Hard and soft constraints for reasoning about qualitative conditional preferences
- Exact learning Boolean functions via the monotone theory
- A theory of the learnable
- Exact learning of DNF formulas using DNF hypotheses
This page was built for publication: Learning conditional preference networks
