Preference Learning with Gaussian Processes
Abstract
In this paper, we propose a probabilistic kernel approach to preference learning based on Gaussian processes. A new likelihood function is proposed to capture the preference relations in the Bayesian framework. The generalized formulation is also applicable to tackle many multiclass problems. The overall approach has the advantages of Bayesian methods for model selection and probabilistic prediction. Experimental results compared against the constraint classification approach on several benchmark datasets verify the usefulness of this algorithm.
Cite
Text
Chu and Ghahramani. "Preference Learning with Gaussian Processes." International Conference on Machine Learning, 2005. doi:10.1145/1102351.1102369Markdown
[Chu and Ghahramani. "Preference Learning with Gaussian Processes." International Conference on Machine Learning, 2005.](https://mlanthology.org/icml/2005/chu2005icml-preference/) doi:10.1145/1102351.1102369BibTeX
@inproceedings{chu2005icml-preference,
title = {{Preference Learning with Gaussian Processes}},
author = {Chu, Wei and Ghahramani, Zoubin},
booktitle = {International Conference on Machine Learning},
year = {2005},
pages = {137-144},
doi = {10.1145/1102351.1102369},
url = {https://mlanthology.org/icml/2005/chu2005icml-preference/}
}