Collaborative Gaussian processes for preference learning

Advances in Neural Information Processing Systems

Volumn 3, Issue , 2012, Pages 2096-2104

  Houlsby, Neil ^a   Hernández Lobato, Jose Miguel ^a   Huszár, Ferenc ^a   Ghahramani, Zoubin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LEARNING STRATEGIES; APPROXIMATE INFERENCE; COLLABORATIVE INFORMATION; DIMENSIONALITY REDUCTION; EXPECTATION PROPAGATION; GAUSSIAN PROCESSES; PREFERENCE LEARNING; SHARED STRUCTURES;

GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC); LEARNING ALGORITHMS;

BEHAVIORAL RESEARCH;

EID: 84877789387     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Birlutiu, P. Groot, and T. Heskes. Multi-task preference learning with an application to hearing aid personalization. Neurocomputing, 73(79):1177-1185, 2010.
2. Edwin V. Bonilla, Shengbo Guo, and Scott Sanner. Gaussian process preference elicitation. In Advances in Neural Information Processing Systems 23, pages 262-270, 2010.
3. E. Brochu, N. de Freitas, and A. Ghosh. Active preference learning with discrete choice data. Advances in Neural Information Processing Systems 20, 20:409-416, 2007.
4. W. Chu and Z. Ghahramani. Preference learning with Gaussian processes. In Proceedings of the 22nd international conference on Machine learning, pages 137-144, 2005.
5. M. De Gemmis, L. Iaquinta, P. Lops, C. Musto, F. Narducci, and G. Semeraro. Preference learning in recommender systems. In ECML/PKDD-09 Workshop on Preference Learning, 2009.
6. J. Fürnkranz and E. Hüllermeier. Preference learning. Springer-Verlag New York Inc, 2010.
7. Z. Ghahramani and M. J. Beal. Advanced Mean Field Method-Theory and Practice, chapter Graphical models and variational methods, pages 161-177. 2001.
8. B. Krishnapuram, D. Williams, Y. Xue, A. Hartemink, L. Carin, and M. Figueiredo. On semisupervised classification. In Advances in neural information processing systems 17, pages 721-728, 2004.
9. N.D. Lawrence, M. Seeger, and R. Herbrich. Fast sparse gaussian process methods: The informative vector machine. Advances in Neural Information Processing Systems 15, 15:609-616, 2002.
10. D.V. Lindley. On a measure of the information provided by an experiment. The Annals of Mathematical Statistics, 27(4):986-1005, 1956.
11. D. J. C. MacKay. Local minima, symmetry-breaking, and model pruning in variational free energy minimization. Available at http://www.inference.phy.cam. ac.uk/mackay/minima.pdf, 2001.
12. D.J.C. MacKay. Information-based objective functions for active data selection. Neural computation, 4(4):590-604, 1992.
13. T. Minka and J. Lafferty. Expectation-propagation for the generative aspect model. In Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence, pages 352-359, 2002.
14. Tom Minka. A family of algorithms for approximate Bayesian inference. PhD thesis, MIT, 2001.
15. Hannes Nickisch and Carl Edward Rasmussen. Approximations for binary Gaussian process classification. The Journal of Machine Learning Research, 9:2035-2078, 2008.
16. T. Raiko, A. Ilin, and K. Juha. Principal component analysis for large scale problems with lots of missing values. In Joost Kok, Jacek Koronacki, Raomon Mantaras, Stan Matwin, Dunja Mladenic, and Andrzej Skowron, editors, Machine Learning: ECML 2007, volume 4701 of Lecture Notes in Computer Science, pages 691-698. Springer Berlin / Heidelberg, 2007.
17. P. Sebastiani and H.P. Wynn. Maximum entropy sampling and optimal Bayesian experimental design. Journal of the Royal Statistical Society. Series B (Statistical Methodology), 62(1):145-157, 2000.
18. E. Snelson and Z. Ghahramani. Sparse gaussian processes using pseudo-inputs. In Advances in Neural Information Processing Systems 18, 2005.
19. D. H. Stern, R. Herbrich, and T. Graepel. Matchbox: large scale online bayesian recommendations. In Proceedings of the 18th international conference on World wide web, pages 111-120, 2009.