Learning to rank: From pairwise approach to listwise approach

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 129-136

  Cao, Zhe ^a   Qin, Tao ^a   Liu, Tie Yan ^b   Tsai, Ming Feng ^c   Li, Hang ^b  

^a TSINGHUA UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

GRADIENT METHODS; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; PROBABILITY;

GRADIENT DESCENT; PERMUTATION PROBABILITY; PROBABILITY MODELS;

LEARNING SYSTEMS;

EID: 34547987951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273513     Document Type: Conference Paper

References (20)

1. Baeza-Yates, R., & Ribeiro-Neto, B. (1999). Modern information retrieval. Addison Wesley.
2. Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005). Learning to rank using gradient descent. Proceedings of ICML 2005 (pp. 89-96).
3. Cao, Y. B., Xu, J., Liu, T. Y., Li, H., Huang, Y. L., & Hon, H. W. (2006). Adapting ranking SVM to document retrieval. Proceedings of SIGIR 2006 (pp. 186-193).
4. Cao, Z., Qin, T., Liu, T-Y., Tsai, M.-F., & Li, H. (2007). Learning to rank: From pairwise approach to listwise approach (Technical Report MSR-TR-2007-40). Microsoft Corporation.
5. Cohen, W. W., Schapire, R. E., & Singer, Y. (1998). Learning to order things. Advances in Neural Information Processing Systems. The MIT Press.
6. Crammer, K., & Singer, Y. (2001). Pranking with ranking. Proceedings of NIPS 2001.
7. Craswell, N., Hawking, D., Wilkinson, R., & Wu, M. (2003). Overview of the TREC 2003 web track. Proceedings of TREC 2003 (pp. 78-92).
8. Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (1998). An efficient boosting algorithm for combining preferences. Proceedings of ICML 1998 (pp. 170-178).
9. Herbrich, R., Graepel, T., & Obermayer, K. (1999). Support vector learning for ordinal regression. Proceedings of ICANN 1999 (pp. 97-102).
10. Hersh, W. R., Buckley, C., Leone, T. J., & Hickam, D. H. (1994). OHSUMED: An interactive retrieval evaluation and new large test collection for research. Proceedings of SIGIR 1994 (pp. 192-201).
11. Jarvelin, K., & Kekanainen, J. (2000). IR evaluation methods for retrieving highly relevant documents. Proceedings of SIGIR 2000 (pp. 41-48).
12. Joachims, T. (1999). Making large-scale support vector machine learning practical. Advances in kernel methods: support vector learning, 169-184.
13. Joachims, T. (2002). Optimizing search engines using clickthrough data. Proceedings of KDD 2002 (pp. 133-142).
14. Lebanon, G., & Lafferty, J. (2002). Cranking: Combining rankings using conditional probability models on permutations. Proceedings of ICML 2002 (pp. 363-370).
15. Luce, R. D. (1959). Individual choice behavior. Wiley.
16. Nallapati, R. (2004). Discriminative models for information retrieval. Proceedings of SIGIR 2004 (pp. 64-71).
17. Plackett, R. L. (1975). The analysis of permutations. Applied Statistics, 24(2), 193-202.
18. Qin, T., Liu, T.-Y., Lai, W., Zhang, X.-D., Wang, D.-S., , & Li, H. (2007). Ranking with multiple hyperplanes. Proceedings of SIGIR 2007.
19. Shashua, A., & Levin, A. (2002). Taxonomy of large margin principle algorithms for ordinal regression problems. Proceedings of NIPS 2002.
20. Tsai, M.-F., Liu, T.-Y., Qin, T., Chen, H.-H., & Ma, W.-Y. (2007). Frank: A ranking method with fidelity loss. Proceedings of SIGIR 2007.