Fast active exploration for link-based preference learning using gaussian processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6323 LNAI, Issue PART 3, 2010, Pages 499-514

  Xu, Zhao ^a   Kersting, Kristian ^a   Joachims, Thorsten ^b  

^a FRAUNHOFER IAIS   (Germany)

^b School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE EXPLORATIONS; ACTIVE LEARNING; DATA SETS; FEATURE VECTORS; GAUSSIAN PROCESSES; IMPLICIT FEEDBACK; INCREMENTAL UPDATES; LEARNING PROBLEM; MODEL DEPENDENCIES; PREFERENCE LEARNING; RELEVANCE SCORE; TRAINING DATA; WEB SEARCHES;

COMPUTATIONAL EFFICIENCY; GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC); INFORMATION RETRIEVAL; LEARNING SYSTEMS; MATHEMATICAL MODELS; NATURAL LANGUAGE PROCESSING SYSTEMS; WORLD WIDE WEB;

LEARNING ALGORITHMS;

EID: 77958058026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15939-8_32     Document Type: Conference Paper

References (28)

1. Bilgic, M., Getoor, L.: Link-based active learning. In: Proceedings of NIPS Work-shop on Analyzing Networks and Learning with Graphs (2009)
2. Brinker, K.: Active learning oflabel ranking functions. In: Proc. of ICML (2004)
3. Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullen-der, G.: Learning to rank using gradient descent. In: ICML (2005)
4. Chu, W., Ghahramani, Z.: Preference learning with gaussian processes. In: ICML (2005)
5. Donmez, P., Carbonell, J.G.: Active sampling for rank learning via optimizing the area under the roc curve. In: Proc. ECIR (2009)
6. Brochu, N.d.E., Ghosh, A.: Active preference learning with discrete choice data. In: Advances in Neural Information Processing Systems, NIPS (2007)
7. Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. JMLR 4, 933-969 (2003)
8. Fürnkranz, J., Hüllermeier, E.: Preference learning and ranking by pairwise com-parison. In: Preference learning. Springer, Heidelberg (2010)
9. Geerts, F., Mannila, H., Terzi, E.: Relational link-based ranking. In: Proceedings of VLDB-04, pp. 552-563 (2004)
10. Getoor, L., Taskar, B. (eds.): An Introduction to Statistical Relational Learning. MIT Press, Cambridge (2007)
11. Guiver, J., Snelson, E.: Learning to rank with softrank and gaussian processes. In: SIGIR (2008)
12. Hüllermeier, E., Fürnkranz, J., Cheng, W., Brinker, K.: Label ranking by learning pairwise preferences. Artificial Intelligence 172(16-17), 1897-1916 (2008)
13. Joachims, T., Granka, L., Pan, B., Hembrooke, H., Radlinski, F., Gay, G.: Eval-uating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Transactions on Information Systems (TOIS) 25(2) (April 2007)
14. Kersting, K., Xu, Z.: Learning preferences with hidden common cause relations. In: Preceding of ECML09 (2009)
15. Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)
16. Minka, T.: A family of algorithms for approximate Bayesian inference. PhD thesis, MIT (2001)
17. 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)
18. Qin, T., Liu, T.-Y., Xu, J., Li, H.: Letor: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval Journal (2010)
19. Radlinski, F., Joachims, T.: Active exploration for learning rankings from click-through data. In: Proc. SIGKDD, pp. 570-579 (2007)
20. Rasmussen, C.E., Williams, C.K.I.: Gaussian Processes for Machine Learning. The MIT Press, Cambridge (2006)
21. Saar-Tsechansky, M., Provost, F.: Active sampling for class probability estimation and ranking. Machine Learning 54(2), 153-178 (2004)
22. Schwaighofer, A., Tresp, V., Yu, K.: Learning gaussian process kernels via hierar-chical bayes. In: NIPS 17 (2005)
23. Smola, A.J., Kondor, I.: Kernels and regularization on graphs. In: Annual Conference on Computational Learning Theory (2003)
24. Taskar, B., Wong, M., Koller, D.: Learning on the test data: Leveraging unseen features. In: ICML (2003)
25. Yu, H.: Selective sampling for ranking with application to data retrieval. In: Proc. SIGKDD (2005)
26. Yue, Y., Broder, J., Kleinberg, R., Joachims, T.: The k-armed dueling bandits problem. In: Conference on Learning Theory, COLT (2009)
27. Yue, Y., Joachims, T.: Interactively optimizing information retrieval systems as a dueling bandits problem. In: Proc. ICML (2009)
28. Zhu, X., Lafferty, J., Ghahramani, Z.: Semi-supervised learning: From gaussian fields to gaussian processes. Technical Report CMU-CS-03-175, CMU (2003)