The complexity of exact learning of acyclic conditional preference networks from swap examples.
Eisa AlanaziMalek MouhoubSandra ZillesPublished in: Artif. Intell. (2020)
Keyphrases
- exact learning
- cp nets
- membership queries
- query complexity
- membership and equivalence queries
- learning algorithm
- concept class
- uniform distribution
- boolean functions
- vapnik chervonenkis dimension
- equivalence queries
- tree patterns
- efficient learning
- multi attribute
- worst case
- pac learning
- graphical representation
- target concept
- soft constraints
- dnf formulas
- learning theory
- multiple agents
- utility independence
- concept classes
- upper bound
- np hard
- computational complexity
- training data