Proceedings

Multi-Relational Learning with Gaussian Processes

Download BibTeX Cite

Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1309-1313.

© 2009 International Joint Conferences on Artificial Intelligence

Abstract

Due to their flexible nonparametric nature, Gaussian process models are very effective at solving hard machine learning problems. While existing Gaussian process models focus on modeling one single relation, we present a generalized GP model, named multi-relational Gaussian process model, that is able to deal with an arbitrary number of relations in a domain of interest. The proposed model is analyzed in the context of bipartite, directed, and undirected univariate relations. Experimental results on real-world datasets show that exploiting the correlations among different entity types and relations can indeed improve prediction performance.Zhao Xu, Kristian Kersting, Volker Tresp

  1. [Carbonetto et al., 2005] P. Carbonetto, J. Kisynski, N. de Freitas, and D. Poole. Nonparametric bayesian logic. In Proc. 21st Conf. on Uncertainty in AI (UAI), 2005.
  2. [Chu et al., 2006] W. Chu, V. Sindhwani, Z. Ghahramani, and S. Keerthi. Relational learning with gaussian pro- cesses. In Neural Information Processing Systems, 2006.
  3. [De Raedt, 2008] L. De Raedt. Logical and Relational Learning. Springer, 2008.
  4. [Getoor and Taskar, 2007] L. Getoor and B. Taskar, editors. Introduction to Statistical Relational Learning. The MIT Press, 2007.
  5. [Guiver and Snelson, 2008] J. Guiver and E. Snelson. Learn- ing to rank with softrank and gaussian processes. In SIGIR, 2008.
  6. [Kemp et al., 2006] C. Kemp, J. B. Tenenbaum, T. L. Grif- fiths, T. Yamada, and N. Ueda. Learning systems of con- cepts with an infinite relational model. In Proc. 21st AAAI, 2006.
  7. [Lawrence, 2005] N.D. Lawrence. Probabilistic non-linear principal component analysis with gaussian process latent variable models. JMLR, 6:1783-1816, 2005.
  8. [Minka, 2001] T.P. Minka. A family of algorithms for ap- proximate Bayesian inference. PhD thesis, MIT, 2001.
  9. [Rasmussen and Williams, 2006] C.E. Rasmussen and C.K. Williams. Gaussian Processes for Machine Learning. The MIT Press, 2006.
  10. [Rummel, 1999] R.J. Rummel. Dimensionality of nations project: attributes of nations and behavior of nation dyads 19501965. In ICPSR data file. 1999.
  11. [Sarwar et al., 2000] B. M. Sarwar, G. Karypis, J. A. Kon- stan, and J. Riedl. Analysis of recommender algorithms for e-commerce. In Proc. ACM E-Commerce Conference, pages 158-167. ACM, 2000.
  12. [Silva et al., 2007] R. Silva, W. Chu, and Z. Ghahramani. Hidden common cause relations in relational learning. In Neural Information Processing Systems, 2007.
  13. [Singh and Gordon., 2008] A.P. Singh and G.J. Gordon. Re- lational learning via collective matrix factorization. In Proc. 14th Intl. Conf. on Knowledge Discovery and Data Mining, 2008.
  14. [Xu et al., 2006] Z. Xu, V. Tresp, K. Yu, and H.-P. Kriegel. Infinite hidden relational models. In Proc. 22nd UAI, 2006.
  15. [Yu and Chu, 2007] K. Yu and W. Chu. Gaussian process models for link analysis and transfer learning. In Neural Information Processing Systems, 2007.
  16. [Yu et al., 2006] K. Yu, W. Chu, S. Yu, V. Tresp, and Z. Xu. Stochastic relational models for discriminative link predic- tion. In Neural Information Processing Systems, 2006.
  17. [Zhu et al., 2005] X. Zhu, J. Kandola, J. Lafferty, and Z. Ghahramani. Graph kernels by spectral transforms. In O. Chapelle, B. Schoelkopf, and A. Zien, editors, Semi- Supervised Learning. MIT Press, 2005.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards