A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Prediction, Learning, and Games
Prediction, Learning, and Games
Journal of Artificial Intelligence Research
On graphical modeling of preference and importance
Journal of Artificial Intelligence Research
Second workshop on information heterogeneity and fusion in recommender systems (HetRec2011)
Proceedings of the fifth ACM conference on Recommender systems
| Hi-index | 0.00 |
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.