Learning Preferences with Hidden Common Cause Relations

Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic inference. For many entities encountered in real-world applications, however, there are complex relations between them. In this paper, we present a preference model which incorporates information on relations among entities. Specifically, we propose a probabilistic relational kernel model for preference learning based on Silva et al.’s mixed graph Gaussian processes: a new prior distribution, enhanced with relational graph kernels, is proposed to capture the correlations between preferences. Empirical analysis on the LETOR datasets demonstrates that relational information can improve the performance of preference learning.

• Type: Conference
• Year: 2009
• Where: PKDD
• Authors: Kristian Kersting, Zhao Xu
• Keywords: Data Mining, Gaussian Processes, PKDD 2009, Probabilistic Relational Kernel, Relational Graph Kernels