Skip to main content

Weight-Based Boosting Model for Cross-Domain Relevance Ranking Adaptation

  • Conference paper
Advances in Information Retrieval (ECIR 2011)

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

Included in the following conference series:

Abstract

Adaptation techniques based on importance weighting were shown effective for RankSVM and RankNet, viz., each training instance is assigned a target weight denoting its importance to the target domain and incorporated into loss functions. In this work, we extend RankBoost using importance weighting framework for ranking adaptation. We find it non-trivial to incorporate the target weight into the boosting-based ranking algorithms because it plays a contradictory role against the innate weight of boosting, namely source weight that focuses on adjusting source-domain ranking accuracy. Our experiments show that among three variants, the additive weight-based RankBoost, which dynamically balances the two types of weights, significantly and consistently outperforms the baseline trained directly on the source domain.

This work is partially supported by NSFC grant (No. 60925008), 973 program (No. 2010CB731402) and 863 program (No. 2009AA01Z150) of China.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Amini, M.R., Truong, T.V., Goutte, C.: A boosting algorithm for learning bipartite ranking functions with partially labeled data. In: Proc. of SIGIR (2008)

    Google Scholar 

  2. Freund, Y., Iyer, R., Schapire, R., Singer, Y.: An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research (2004)

    Google Scholar 

  3. Gao, W., Cai, P., Wong, K.-F., Zhou, A.: Learning to rank only using training data from related domain. In: Proc. of SIGIR (2010)

    Google Scholar 

  4. Liu, T.-Y.: Learning to rank for information retrieval. In: Foundations and Trends in Information Retrieval (2009)

    Google Scholar 

  5. Qin, T., Liu, T.-Y., Xu, J., Li, H.: LETOR: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval (2010)

    Google Scholar 

  6. Hastie, T., Tibshirani, R., Friedman, J.H.: The elements of statistical learning. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  7. Voorhees, E.M.: Overview of TREC 2004. In: Proc. of TREC (2004)

    Google Scholar 

  8. Xu, J., Li, H.: Adarank: A boosting algorithm for information retrieval. In: Proc. of SIGIR (2007)

    Google Scholar 

  9. Zheng, Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., Sun, G.: A general boosting method and its application to learning ranking functions for web search. In: Proc. of NIPS (2007)

    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

Cai, P., Gao, W., Wong, KF., Zhou, A. (2011). Weight-Based Boosting Model for Cross-Domain Relevance Ranking Adaptation. In: Clough, P., et al. Advances in Information Retrieval. ECIR 2011. Lecture Notes in Computer Science, vol 6611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20161-5_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20161-5_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20160-8

  • Online ISBN: 978-3-642-20161-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics