An Empirical Investigation of Ceteris Paribus Learnability Loizos Michael and Elena Papageorgiou
Abstract
Eliciting user preferences constitutes a major step towards developing recommender systems and decision support tools. Assuming that preferences are ceteris paribus allows for their concise representation as Conditional Preference Networks (CP-nets). This work presents the ?rst empirical investigation of an algorithm for reliably and ef?ciently learning CP-nets in a manner that is minimally intrusive. At the same time, it introduces a novel process for ef?ciently reasoning with (the learned) preferences.