Learning to re-rank web search results with multiple pairwise features

Proceedings of the 4th ACM International Conference on Web Search and Data Mining, WSDM 2011

Volumn , Issue , 2011, Pages 735-744

  Kang, Changsung ^a   Wang, Xuanhui ^a   Chen, Jiang ^b   Liao, Ciya ^c   Chang, Yi ^a   Tseng, Belle ^a   Zheng, Zhaohui ^a  

^a YAHOO RESEARCH   (United States)

^b GOOGLE INC   (United States)

^c MICROSOFT   (United States)

Author keywords

Pairwise features; Re rank

Indexed keywords

DATA SETS; FUNCTION DECOMPOSITION METHOD; HIGH CONFIDENCE; LEARNING SETTINGS; PAIR-WISE COMPARISON; PAIRWISE FEATURES; RANKING FUNCTIONS; RE-RANK; RE-RANKING; SEARCH RESULTS; TWO MACHINES; WEB SEARCHES;

DATA MINING; INFORMATION RETRIEVAL; MACHINE DESIGN; SEARCH ENGINES;

WORLD WIDE WEB;

EID: 79952380648     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1935826.1935924     Document Type: Conference Paper

References (27)

1. E. Agichtein, E. Brill, S. Dumais, and R. Ragno. Learning user interaction models for predicting web search result preferences. In Proceedings of ACM SIGIR 2006, pages 3-10, New York, NY, USA, 2006. ACM Press.
2. N. Alon. Ranking tournaments. SIAM J. Discret. Math., 20 (1): 137-142, 2006. (Pubitemid 46352091)
3. C. Burges. Ranking as function approximation. Algorithms for Approximation, pages 3-18, 2006.
4. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In Proceedings of the 22nd international conference on Machine learning, pages 89-96, 2005.
5. Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: from pairwise approach to listwise approach. In ICML '07: Proceedings of the 24th international conference on Machine learning, pages 129-136, New York, NY, USA, 2007. ACM.
6. M. L. Chao Liu and Y.-M. Wang. Post-rank reordering: Resolving preference misalignments between search engines and end users. In CIKM '09: Proceedings of the 18th ACM international conference on Information and knowledge management, 2009.
7. O. Chapelle and Y. Zhang. A dynamic bayesian network click model for web search ranking. In WWW '09: Proceedings of the 18th international conference on World wide web, pages 1-10, New York, NY, USA, 2009. ACM.
8. C. Cortes, M. Mohri, and A. Rastogi. Magnitude-preserving ranking algorithms. In Proceedings of the 24th ICML, 2007.
9. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM'08: Proceedings of the international conference on Web search and web data mining, pages 87-94, 2008.
10. F. Diaz. Regularizing ad hoc retrieval scores. In CIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management, pages 672-679, New York, NY, USA, 2005. ACM.
11. G. Dupret and C. Liao. A model to estimate intrinsic document relevance from the clickthrough logs of a web search engine. In WSDM '10: Proceedings of the third ACM international conference on Web search and data mining, pages 181-190, 2010.
12. Y. Freund, R. Iyer, R. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. In Proceedings of the Fifteenth International Conference on Machine Learning, 1998.
13. J. Friedman. Greedy function approximation: a gradient boosting machine. Ann. Statist., 29: 1189-1232, 2001. (Pubitemid 33405972)
14. J. Guiver and E. Snelson. Learning to rank with SoftRank and Gaussian processes. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, 2008
15. E. Hüllermeier, J. Fürnkranz, W. Cheng, and K. Brinker. Label ranking by learning pairwise preferences. Artif. Intell., 172 (16-17):1897-1916, 2008.
16. N. Jardine and C. J. V. Rijsbergen. The use of hierarchic clustering in information retrieval. Information Storage and Retrieval, 15: 217-240, 1971.
17. S. Ji, K. Zhou, C. Liao, Z. Zheng, G.-R. Xue, O. Chapelle, G. Sun, and H. Zha. Global ranking by exploiting user clicks. In SIGIR '09: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 35-42, New York, NY, USA, 2009. ACM.
18. T. Joachims. Optimizing search engines using clickthrough data. In KDD '02: Proceedings of the eighth ACM SIGKDD, pages 133-142, New York, NY, USA, 2002. ACM Press.
19. T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In Proceedings of ACM SIGIR 2005, pages 154-161, New York, NY, USA, 2005. ACM Press.
20. T. Joachims, L. Granka, B. Pan, H. Hembrooke, F. Radlinski, and G. Gay. Evaluating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Transactions on Information Systems (TOIS), 25 (2), 2007.
21. T. Qin, T.-Y. Liu, X.-D. Zhang, D.-S. Wang, and H. Li. Global ranking using continuous conditional random fields. In NIPS, pages 1281-1288, 2008.
22. T. Qin, T.-Y. Liu, X.-D. Zhang, D.-S. Wang, W.-Y. Xiong, and H. Li. Learning to rank relational objects and its application to web search. In WWW '08, pages 407-416, 2008.
23. M. Taylor, J. Guiver, S. Robertson, and T. Minka. Softrank: optimizing non-smooth rank metrics. In WSDM '08: Proceedings of the international conference on Web search and web data mining, pages 77-86, New York, NY, USA, 2008. ACM.
24. M. N. Volkovs and R. S. Zemel. Boltzrank: learning to maximize expected ranking gain. In ICML '09: Proceedings of the 26th Annual International Conference on Machine Learning, pages 1089-1096, New York, NY, USA, 2009. ACM.
25. J. Xu and H. Li. Adarank: a boosting algorithm for information retrieval. In SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 391-398, New York, NY, USA, 2007. ACM.
26. Z. Zheng, K. Chen, G. Sun, and H. Zha. A regression framework for learning ranking functions using relative relevance judgments. In Proceedings of the 30th ACM SIGIR conference, 2007.
27. Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, and G. Sun. A general boosting method and its application to learning ranking functions for web search. In Advances in Neural Information Processing Systems 20, pages 1697-1704. MIT Press, 2008.