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.
Cite
Text
Kersting and Xu. "Learning Preferences with Hidden Common Cause Relations." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2009. doi:10.1007/978-3-642-04180-8_61Markdown
[Kersting and Xu. "Learning Preferences with Hidden Common Cause Relations." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2009.](https://mlanthology.org/ecmlpkdd/2009/kersting2009ecmlpkdd-learning/) doi:10.1007/978-3-642-04180-8_61BibTeX
@inproceedings{kersting2009ecmlpkdd-learning,
title = {{Learning Preferences with Hidden Common Cause Relations}},
author = {Kersting, Kristian and Xu, Zhao},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2009},
pages = {676-691},
doi = {10.1007/978-3-642-04180-8_61},
url = {https://mlanthology.org/ecmlpkdd/2009/kersting2009ecmlpkdd-learning/}
}