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.
Chapter PDF
Similar content being viewed by others
Keywords
- Gaussian Process
- Latent Function
- Multivariate Gaussian Distribution
- Preference Learning
- Preference Degree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agarwal, S.: Ranking on graph data. In: ICML, pp. 25–32 (2006)
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: ICML (2005)
Chakrabarti, S.: Learning to rank in vector spaces and social networks. In: WWW 2007 (2007)
Chu, W., Ghahramani, Z.: Gaussian processes for ordinal regression. Journal of Machine Learning Research 6, 1019–1041 (2005)
Chu, W., Ghahramani, Z.: Preference learning with gaussian processes. In: ICML (2005)
Chu, W., Sindhwani, V., Ghahramani, Z., Keerthi, S.: Relational learning with gaussian processes. In: Neural Information Processing Systems (2006)
Chung, F.R.K.: Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics 9, 1–19 (2005)
Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. JMLR 4, 933–969 (2003)
Geerts, F., Mannila, H., Terzi, E.: Relational link-based ranking. In: Proceedings of VLDB 2004, pp. 552–563 (2004)
Guiver, J., Snelson, E.: Learning to rank with softrank and gaussian processes. In: SIGIR (2008)
Hersh, W., Buckley, C., Leone, T., Hickam, D.: Ohsumed: an interactive retrieval evaluation and new large test collection for research. In: SIGIR (2007)
Hüllermeier, E., Fürnkranz, J., Cheng, W., Brinker, K.: Label ranking by learning pairwise preferences. Artificial Intelligence 172(16–17), 1897–1916 (2008)
Joachims, T.: Optimizing search engines using clickthrough data. In: SIGKDD (2002)
Kim, H.-C., Ghahramani, Z.: Bayesian gaussian process classification with the em-ep algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(12), 1948–1959 (2006)
Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research (JMLR) 9, 235–284 (2008)
Liu, T.-Y., Qin, T., Xu, J., Xiong, W.-Y., Li, H.: Letor: benchmark dataset for research on learning to rank for information retrieval. In: SIGIR 2007 Workshop on LR4IR (2007)
Minka, T.: A family of algorithms for approximate Bayesian inference. PhD thesis, MIT (2001)
Qin, T., Liu, T., Zhang, X., Wang, D., Xiong, W., Li, H.: Learning to rank relational objects and its application to web search. In: WWW (2008)
Radlinski, F., Joachims, T.: Active exploration for learning rankings from clickthrough data. In: Proceedings of KDD 2007, pp. 570–579 (2007)
Rasmussen, C.E., Williams, C.K.I.: Gaussian Processes for Machine Learning. MIT Press, Cambridge (2006)
Silva, R., Chu, W., Ghahramani, Z.: Hidden common cause relations in relational learning. In: Neural Information Processing Systems (2007)
Smola, A.J., Kondor, I.: Kernels and regularization on graphs. In: Annual Conference on Computational Learning Theory (2003)
Xu, Z., Kersting, K., Tresp, V.: Multi-relational learning with gaussian processes. In: Boutilier, C. (ed.) Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2009 (to appear, 2009)
Yu, K., Chu, W., Yu, S., Tresp, V., Xu, Z.: Stochastic relational models for discriminative link prediction. In: Neural Information Processing Systems (2006)
Zhu, X., Kandola, J., Lafferty, J., Ghahramani, Z.: Graph kernels by spectral transforms. In: Chapelle, O., Schoelkopf, B., Zien, A. (eds.) Semi-Supervised Learning. MIT Press, Cambridge (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kersting, K., Xu, Z. (2009). Learning Preferences with Hidden Common Cause Relations. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2009. Lecture Notes in Computer Science(), vol 5781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04180-8_61
Download citation
DOI: https://doi.org/10.1007/978-3-642-04180-8_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04179-2
Online ISBN: 978-3-642-04180-8
eBook Packages: Computer ScienceComputer Science (R0)