Skip to main content

Importance Weighted AdaRank

  • Conference paper
Book cover Advanced Intelligent Computing (ICIC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6838))

Included in the following conference series:

Abstract

Learning to rank for information retrieval needs some domain experts to label the documents used in the training step. It is costly to label documents for different research areas. In this paper, we propose a novel method which can be used as a cross-domain adaptive model based on importance weighting, a common technique used for correcting the bias or discrepancy. Here we use “cross-domain” to mean that the input distribution is different in the training and testing phases. Firstly, we use Kullback-Leibler Importance Estimation Procedure (KLIEP), a typical method in importance weighing, to do importance estimation. Then we modify AdaRank so that it becomes a transductive model. Experiments on OHSUMED show that our method performs better than some other state-of-the-art methods.

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. Joachims, T.: Optimizing Search Engine using Clickthrough Data. In: Proceedings of the ACM Conference on Knowledge, Discovery and Data Mining, Edmonton, Alberta, Canada, pp. 133–142 (2002)

    Google Scholar 

  2. Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Smola, A., Bartlett, P., Sch-lkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 115–132 (2000)

    Google Scholar 

  3. Freund, Y., Iyer, R., Schapire, R., Singer, Y.: An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research 4, 933–969 (2003)

    MathSciNet  MATH  Google Scholar 

  4. Xishuang, D., Xiaodong, C., Yi, G., Zhiming, X., Sheng, L.: An Overview of Learning to Rank for Information Retrieval. In: CSIE, vol. 03 (2009)

    Google Scholar 

  5. Sugiyama, M., Suzuki, T., Nakajima, S., Kashima, H., von Bnau, P., Kawanbe, M.: Direct importance estimation for covariate shift adaptation. Annals of the Institute of Statistical Mathematics 60(4), 699–746 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Shimodaira: Improving predictive inference under covariate shift by weighting the log-likelihood function. Journal of Statistical Planning and Inference 90(2), 227–244 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Xu, J., Li, H.: AdaRank: A boosting algorithm for information retrieval. In: SIGIR, Amsterdam, Netherlands, pp. 391–398 (2007)

    Google Scholar 

  8. Qin, T., Liu, T.Y., Tsai, M.F., Zhang, X.D., Li, H.: Learning to search web pages with query-level loss functions. Technical Report MSR-TR (2006)

    Google Scholar 

  9. Depin, C., Yan, X., Jun, Y., Gui, R.X., Gang, W., Zheng, C.: Knowledge transfer for cross domain learning to rank. Information Retrieval 13, 236–253 (2009)

    Google Scholar 

  10. Xiubo, G., Yan, T.L., Tao, Q., Andrew, A., Hang, L., Heung, Y.S.: Query dependent ranking using k-nearest neighbor. In: SIGIR, Singapore (2008)

    Google Scholar 

  11. Wei, G., Peng, C., Kam, F.W.,Aoying, Z.: Learning to rank only using training data from related domain. In: SIGIR, Geneva, Switzerland (2010)

    Google Scholar 

  12. Christopher, D.M., Prabhakar, R., Hinrich, S.: An Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)

    MATH  Google Scholar 

  13. Ping, L., Christopher, J.C.B., Qiang, W.: McRank: Learning to Rank Using Classification and Gradient Boosting. In: Proceedings of the International Conference on Advances in Neural Information Processing Systems, Vancouver, B.C., Canada (2007)

    Google Scholar 

  14. Robert, E.S., Yoram, S.: Improved boosting algorithms using confidence-rated predictions. Machine Learning 37(3), 297–336 (1999)

    Article  MATH  Google Scholar 

  15. William, W.C.: Fast Effective Rule Induction. In: Proc. Twelfth Int’l. Conf. on Machine Learning, pp. 115–123. Morgan Kaufman, San Francisco (1995)

    Google Scholar 

  16. Kevin, D., Katrin, K.: Semi-supervised ranking for document retrieval. Computer Speech and Language 25, 261–281 (2011)

    Article  Google Scholar 

  17. Jun, Xu., Yan, T.L. and Hang, L.: The OHSUMED Dataset in LETOR. Microsoft Research Asia (2007)

    Google Scholar 

  18. AdaRank on LETOR, http://research.microsoft.com/en-us/um/beijing/projects/letor/baselines/adarank.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Yong Gan Vitoantonio Bevilacqua Juan Carlos Figueroa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ren, S., Hou, Y., Zhang, P., Liang, X. (2011). Importance Weighted AdaRank. In: Huang, DS., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing. ICIC 2011. Lecture Notes in Computer Science, vol 6838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24728-6_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24728-6_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24727-9

  • Online ISBN: 978-3-642-24728-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics