skip to main content
10.1145/2351356.2351358acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Using boosted trees for click-through rate prediction for sponsored search

Published:12 August 2012Publication History

ABSTRACT

We describe a new approach to solving the click-through rate (CTR) prediction problem in sponsored search by means of MatrixNet, the proprietary implementation of boosted trees. This problem is of special importance for the search engine, because choosing the ads to display substantially depends on the predicted CTR and greatly affects the revenue of the search engine and user experience. We discuss different issues such as evaluating and tuning MatrixNet algorithm, feature importance, performance, accuracy and training data set size. Finally, we compare MatrixNet with several other methods and present experimental results from the production system.

References

  1. K. Bauman, A. Kornetova, V. Topinsky, and D. Leshiner. Ctr prediction based on click statistic. In Workshop: Machine Learning in Online Advertising, pages 8--13. NIPS, December 2010.Google ScholarGoogle Scholar
  2. A. Broder and V. Josifovski. Introduction to Computational Advertising. http://www.stanford.edu/class/msande239/.Google ScholarGoogle Scholar
  3. K. Dave and V. Varma. Optimizing display advertisements based on historic user trails. In WWW, 2011.Google ScholarGoogle Scholar
  4. K. Dembczynski, W. Kotlowski, and D. Weiss. Predicting ads' click-through rate with decision rules. In WWW, April 2008.Google ScholarGoogle Scholar
  5. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242--259, 2007.Google ScholarGoogle Scholar
  6. J. Friedman. Greedy function approximation: A gradient boosting machine. In Techical Report. Dept. of Statistics, Stanford University, 1999.Google ScholarGoogle Scholar
  7. J. Friedman. Stochastic gradient boosting. Computational Statistics and Data Analysis, (38):367--378, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. T. Graepel, J. Q. Candela, T. Borchert, and R. Herbrich. Web-scale bayesian click-through rate prediction for sponsored search advertising in microsoft's bing search engine. In ICML, 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Gulin. Matrixnet. Technical report, http://www.ashmanov.com/arc/searchconf2010/08gulin-searchconf2010.ppt, 2010. (in russian).Google ScholarGoogle Scholar
  10. A. Gulin, I. Kuralenok, and D. Pavlov. Winning the transfer learning track of yahoo!'s learning to rank challenge with yetirank. In Workshop and Conference Proceedings, pages 63--76. JMLR, 2011.Google ScholarGoogle Scholar
  11. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer-Verlag, New York, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  12. T. Lumley. biglm: bounded memory linear and generalized linear models, 2011. R package version 0.8.Google ScholarGoogle Scholar
  13. R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2011. ISBN 3-900051-07-0.Google ScholarGoogle Scholar
  14. M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: Estimating the click-through rate for new ads. In WWW. ACM Press, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Ridgeway. gbm: Generalized Boosted Regression Models, 2010. R package version 1.6--3.1.Google ScholarGoogle Scholar
  16. Z. A. Zhu, W. Chen, T. Minka, C. Zhu, and Z. Chen. A novel click model and its applications to online advertising. In WSDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Using boosted trees for click-through rate prediction for sponsored search

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ADKDD '12: Proceedings of the Sixth International Workshop on Data Mining for Online Advertising and Internet Economy
        August 2012
        77 pages
        ISBN:9781450315456
        DOI:10.1145/2351356

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 12 August 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate12of21submissions,57%

        Upcoming Conference

        KDD '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader