Skip to main content

Learning to Rank by Optimizing Expected Reciprocal Rank

  • Conference paper
Information Retrieval Technology (AIRS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7097))

Included in the following conference series:

Abstract

Learning to rank is one of the most hot research areas in information retrieval, among which listwise approach is an important research direction and the methods that directly optimizing evaluation metrics in listwise approach have been used for optimizing some important ranking evaluation metrics, such as MAP, NDCG and etc. In this paper, the structural SVMs method is employed to optimize the Expected Reciprocal Rank(ERR) criterion which is named SVMERR for short. It is compared with state-of-the-art algorithms. Experimental results show that SVMERR outperforms other methods on OHSUMED dataset and TD2003 dataset, which also indicate that optimizing ERR criterion could improve the ranking performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liu, T.Y.: Learning to Rank for Information Retrieval. Foundations and Trends in Information Retrieval 3(3), 225–331 (2009)

    Article  Google Scholar 

  2. Li, P., Burges, C., Wu, Q.: McRank: Learning to rank using multiple classification and gradient boosting. In: Proceedings of the 21st Annual Conference on Neural Information Processing Systems (NIPS 2007), Vancouver, British Columbia, Canada, pp. 845–852 (2007)

    Google Scholar 

  3. Crammer, K., Singer, Y.: Pranking with ranking. In: Proceedings of the 14th Annual Conference on Neural Information Processing Systems (NIPS 2002), Vancouver, British Columbia, Canada, pp. 641–647 (2001)

    Google Scholar 

  4. Burges, C., Shaked, T., Renshaw, E.: Learning to Rank using Gradient Descent. In: Proceedings of the 22nd International Conference on Machine Learning (ICML 2005), Bonn, Germany, pp. 89–96 (2005)

    Google Scholar 

  5. Joachims, T.: Optimizing Search Engines using Clickthrough Data. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002), Edmonton, Alberta, Canada, pp. 133–142 (2002)

    Google Scholar 

  6. Cao, Z., Qin, T., Liu, T.Y.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference (ICML 2007), Corvalis, Oregon, USA, pp. 129–136 (2007)

    Google Scholar 

  7. Xia, F., Liu, T.Y., Wang, J.: Listwise approach to learning to rank: theory and algorithm. In: Proceedings of the 25th International Conference (ICML 2008), Helsinki, Finland, pp. 1192–1199 (2008)

    Google Scholar 

  8. Yue, Y.S., Finley, T., Radlinski, F.: A support vector method for optimizing average precision. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2007), Amsterdam, The Netherlands, pp. 271–278 (2007)

    Google Scholar 

  9. Chapelle, O., Metzler, D., Zhang, Y.: Expected Reciprocal Rank for Graded Relevance. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management (CIKM 2009), Hong Kong, China, pp. 621–630 (2009)

    Google Scholar 

  10. Tsochantaridis, I., Hofmann, T., Joachims, T.: Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research (JMLR) 6(9), 1453–1484 (2005)

    MathSciNet  MATH  Google Scholar 

  11. Joachims, T.: A support vector method for multivariate performance measures. In: Proceedings of the 22nd International Conference (ICML 2005), Bonn, Germany, pp. 377–384 (2005)

    Google Scholar 

  12. Qin, T., Liu, T.Y., Xu, J.: LETOR: Benchmark Collection for Research on Learning to Rank for Information Retrieval. In: SIGIR 2007 Workshop on Learning to Rank for Information Retrieval (LR4IR 2007), Amsterdam, The Netherlands, pp. 3–10 (2007)

    Google Scholar 

  13. Chakrabarti, S., Khanna, R., Sawant, U.: Structured learning for non-smooth ranking losses. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008), Las Vegas, Nevada, USA, pp. 88–96 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, P., Lin, H., Lin, Y., Wu, J. (2011). Learning to Rank by Optimizing Expected Reciprocal Rank. In: Salem, M.V.M., Shaalan, K., Oroumchian, F., Shakery, A., Khelalfa, H. (eds) Information Retrieval Technology. AIRS 2011. Lecture Notes in Computer Science, vol 7097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25631-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25631-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25630-1

  • Online ISBN: 978-3-642-25631-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics