Learning to rank with ties

ACM SIGIR 2008 - 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Proceedings

Volumn , Issue , 2008, Pages 275-282

  Zhou, Ke ^a   Xue, Gui Rong ^a   Zha, Hongyuan ^b   Yu, Yong ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b Georgia Institute of Technology   (United States)

Author keywords

Machine learning; Preference learning; Ranking function

Indexed keywords

CORE PROBLEMS; DATA SETS; DEGREE OF RELEVANCES; EXPERIMENTAL STUDIES; GRADIENT BOOSTING; LEARNING FRAMEWORKS; LEARNING PROCESSES; LEARNING TO RANKS; MACHINE LEARNING; MACHINE LEARNINGS; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; PAIRED COMPARISONS; PREFERENCE DATUMS; PREFERENCE LEARNING; RANKING FUNCTION; RANKING FUNCTIONS; SEARCH RESULTS; WEB SEARCHES;

DATA STRUCTURES; INFORMATION RETRIEVAL; INFORMATION SERVICES; LEARNING SYSTEMS; PROBABILITY DENSITY FUNCTION; RESEARCH AND DEVELOPMENT MANAGEMENT; ROBOT LEARNING; WORLD WIDE WEB;

EDUCATION;

EID: 57349131020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390334.1390382     Document Type: Conference Paper

References (31)

1. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, May 1999.
2. R. Bradley and M.Terry. The rank analysis of incomplete block designs: I. the method of paired comparisons. Biometrika, 39, 1952.
3. 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, 2005.
4. C. J. Burges, R. Ragno, and Q. V. Le. Learning to rank with nonsmooth cost functions. In Advances in Neural Information Processing Systems 19, 2007.
5. Y. Cao, J. Xu, T.-Y. Liu, H. Li, Y. Huang, and H.-W. Hon. Adapting ranking svm to document retrieval. In Proceedings of the 29th ACM SIGIR, 2006.
6. Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: from pairwise approach to listwise approach. In Proceedings of the 24th international conference on Machine learning, 2007.
7. C. Cortes, M. Mohri, and A. Rastogi. Magnitude-preserving ranking algorithms. In Proceedings of the 24th ICML, 2007.
8. H. A. David. The Method of Paired Comparisons. Oxford University Press, 2nd edition, 1988.
9. Y. Freund, R. D. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. In Proceedings of the Fifteenth International Conference on Machine Learning, 1998.
10. J. Friedman. Greedy function approximation: a gradient boosting machine. The Annals of Statistics, 29, 2001.
11. J. Friedman. Stochastic gradient boosting. Computational Statistics and Data Analysis, 38, 2002.
12. G. Fung, R. Rosales, and B. Krishnapuram. Learning rankings via convex hull separation. In Advances in Neural Information Processing Systems 18, 2006.
13. T. Hastie, R. Tibshirani, and J. H. Friedman. The Elements of Statistical Learning. Springer, 2001.
14. R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In Advances in Large Margin Classifiers, Cambridge, MA, 2000. MIT Press.
15. K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of IR techniques. ACM Transaction of Information Systems, 20(4), 2002.
16. T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of A CM SIGKDD, 2002.
17. T. Joachims. A support vector method for multivariate performance measures. In Proceedings of the 22nd international conference on Machine learning, 2005.
18. T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In Proceedings of the 28th ACM SIGIR conference, 2005.
19. J. Lafferty and C. Zhai. Document language models, query models, and risk minimization for information retrieval. In Proceedings of the 24th ACM SIGIR, 2001.
20. T. Y. Liu, J. Xu, T. Qin, W. Xiong, and H. Li. Letor: Benchmark dataset for research on learning to rank for information retrieval. In Proceedings of the Learning to Rank workshop in the 30th ACM SIGIR, 2007.
21. F. Radlinski and T. Joachims. Active exploration for learning rankings from clickthrough data. In Proceedings of the 13th ACM SIGKDD, 2007.
22. P. Rao and L. Kupper. Ties in paired-comparison experiments: A generalization of the bradley-terry model, Journal of the American Statistical Association, 62, March 1967.
23. S. Robertson and D. A. Hull. The TREC-9 filtering track final report. Proceedings of the 9th Text REtrieval Conference (TREC-9), 2001.
24. G. Salton, A. Wong, and C. S. Yang. A vector space model for automatic indexing. Commun. ACM, 18(11), 1975.
25. F. Song and W. B. Croft. A general language model for information retrieval. In Proceedings of CIKM, 1999.
26. L. Thurstone. A law of comparative judgement. Psychological Review, 34, 1927.
27. M.-F. Tsai, T.-Y. Liu, T. Qin, H.-H. Chen, and W.-Y. Ma. Frank: a ranking method with fidelity loss. In Proceedings of ACM SIGIR, pages 383-390, 2007.
28. J. Xu and H. Li. Adarank: a boosting algorithm for information retrieval. In Proceedings of the 30th ACM SIGIR, 2007.
29. Y. Yue, T. Finley, F. Radlinski, and T. Joachims. A support vector method for optimizing average precision. In Proceedings of ACM SIGIR, 2007.
30. 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.
31. 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. 2007.