Negative Results for Equivalence Queries
Machine Learning
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Exact learning Boolean functions via the monotone theory
Information and Computation
Machine Learning - Special issue on COLT '94
Machine Learning
Machine Learning
Unifying collaborative and content-based filtering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
On exploiting classification taxonomies in recommender systems
AI Communications - Recommender Systems
Journal of Artificial Intelligence Research
Preference-based configuration of web page content
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
The complexity of learning separable ceteris paribus preferences
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The complexity of learning separable ceteris paribus preferences
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Learning User Preferences for 2CP-Regression for a Recommender System
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Generalized solution techniques for preference-based constrained optimization with CP-nets
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Learning conditionally lexicographic preference relations
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Learning conditional preference network from noisy samples using hypothesis testing
Knowledge-Based Systems
| Hi-index | 0.00 |
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering with a binary-valued CP-net by guiding the user through a sequence of queries. Each example is a dominance test on some pair of outcomes. In this setting, we show that acyclic CP-nets are not learnable with equivalence queries alone, while they are learnable with the help of membership queries if the supplied examples are restricted to swaps. A similar property holds for tree CP-nets with arbitrary examples. In fact, membership queries allow us to provide attribute-efficient algorithms for which the query complexity is only logarithmic in the number of attributes. Such results highlight the utility of this model for eliciting CP-nets in large multi-attribute domains.