skip to main content
10.1145/2556195.2556257acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Estimating ad group performance in sponsored search

Published:24 February 2014Publication History

ABSTRACT

In modern commercial search engines, the pay-per-click (PPC) advertising model is widely used in sponsored search. The search engines try to deliver ads which can produce greater click yields (the total number of clicks for the list of ads per impression). Therefore, predicting user clicks plays a critical role in sponsored search. The current ad-delivery strategy is a two-step approach which first predicts individual ad CTR for the given query and then selects the ads with higher predicted CTR. However, this strategy is naturally suboptimal and correlation between ads is often ignored under this strategy. The learning problem is focused on predicting individual performance rather than group performance which is the more important measurement.

In this paper, we study click yield measurement in sponsored search and focus on the problem---predicting group performance (click yields) in sponsored search. To tackle all challenges in this problem---depth effects, interactive influence, cold start and sparseness of ad textual information---we first investigate several effects and propose a novel framework that could directly predict group performance for lists of ads. Our extensive experiments on a large-scale real-world dataset from a commercial search engine show that we achieve significant improvement by solving the sponsored search problem from the new perspective. Our methods noticeably outperform existing state-of-the-art approaches.

References

  1. D. M. Blei and J. D. McAuliffe. Supervised topic models. In NIPS, 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, 3:993--1022, January 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Bouchard, D. Yin, and S. Guo. Convex collective matrix factorization. In Proceedings of AISTATS 2013.Google ScholarGoogle Scholar
  4. A. Broder and V. Josifovski. Introduction to computational advertising, 2011. Retrieved from http://www.stanford.edu/class/msande239/.Google ScholarGoogle Scholar
  5. B. Cao, D. Shen, K. Wang, and Q. Yang. Clickthrough log analysis by collaborative ranking. In AAAI, 2010.Google ScholarGoogle Scholar
  6. O. Chapelle and Y. Zhang. A dynamic bayesian network click model for web search ranking. In WWW '09. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Chen, W. Chen, H. Wang, Z. Chen, and Q. Yang. Beyond ten blue links: enabling user click modeling in federated web search. In Proceedings of WSDM '2, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Y. Chen and T. W. Yan. Position-normalized click prediction in search advertising. In Proceedings of KDD '12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Cheng and E. Cantú-Paz. Personalized click prediction in sponsored search. In Proceedings of WSDM '10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM '08. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. H. Drucker, C. J. C. Burges, L. Kaufman, A. J. Smola, and V. Vapnik. Support vector regression machines. In NIPS, pages 155--161, 1996.Google ScholarGoogle Scholar
  12. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient projections onto the l1-ball for learning in high dimensions. In Proceedings of ICML '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. G. E. Dupret and B. Piwowarski. A user browsing model to predict search engine click data from past observations. In SIGIR '08. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 '10.Google ScholarGoogle Scholar
  15. F. Guo, C. Liu, A. Kannan, T. Minka, M. Taylor, Y.-M. Wang, and C. Faloutsos. Click chain model in web search. In WWW '09. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. F. Guo, C. Liu, and Y. M. Wang. Efficient multiple-click models in web search. In Proceedings of WSDM '09, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. K. Gupta and D. K. Nagar. Matrix Variate Distributions. Chapman & Hall, 2000.Google ScholarGoogle Scholar
  18. D. Hillard, S. Schroedl, E. Manavoglu, H. Raghavan, and C. Leggetter. Improving ad relevance in sponsored search. In Proceedings of WSDM '10 Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. T. Hofmann. Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 42(1--2):177--196, January-February 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting click through data as implicit feedback. In Proceedings of SIGIR '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Y. Koren. Factor in the neighbors: Scalable and accurate collaborative filtering. ACM Transactions on Knowledge Discovery from Data, 4(1):1--24, January 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30--37, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. C. Liu, F. Guo, and C. Faloutsos. Bbm: bayesian browsing model from petabyte-scale data. In KDD '09, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. C. Liu, F. Guo, and C. Faloutsos. Bayesian browsing model: Exact inference of document relevancfe from petabyte-scale data. ACM Trans. Knowl. Discov. Data, 4(4):19:1--19:26, Oct. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. T.-Y. Liu. Learning to rank for information retrieval. Found. Trends Inf. Retr., 3(3):225--331, Mar. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. A. K. Menon, K.-P. Chitrapura, S. Garg, D. Agarwal, and N. Kota. Response prediction using collaborative filtering with hierarchies and side-information. In KDD '11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. T. Minka, J. Winn, J. Guiver, and A. Kannan. A click through model - sample code. http://research.microsoft.com/en-us/um/cambridge/projects/infernet/docs/Click%20through%20model%20sample.aspx, 2009.Google ScholarGoogle Scholar
  28. T. Moon, A. Smola, Y. Chang, and Z. Zheng. Intervalrank: isotonic regression with listwise and pairwise constraints. In WSDM '10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Rendle. Factorization machines with libFM. ACM Trans. Intell. Syst. Technol., 3(3):57:1--57:22, May 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. In WWW '07. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS 21, pages 1257--1264. 2008.Google ScholarGoogle Scholar
  32. S. Shen, B. Hu, W. Chen, and Q. Yang. Personalized click model through collaborative filtering. In WSDM '12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. R. Srikant, S. Basu, N. Wang, and D. Pregibon. User browsing models: relevance versus examination. In KDD '10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. N. Usunier, D. Buffoni, and P. Gallinari. Ranking with ordered weighted pairwise classification. In ICML '09. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. C. Wang and D. M. Blei. Collaborative topic modeling for recommending scientific articles. In KDD '11, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. X. Wang and et al. Click-through prediction for sponsored search advertising with hybrid models. In KDDCUP 2012, 2012.Google ScholarGoogle Scholar
  37. J. Weston, S. Bengio, and N. Usunier. Large scale image annotation: learning to rank with joint word-image embeddings. Mach. Learn., 81(1):21--35, Oct. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. J. Weston, C. Wang, R. Weiss, and A. Berenzweig. Latent collaborative retrieval. In ICML, 2012.Google ScholarGoogle Scholar
  39. C. Xiong, T. Wang, W. Ding, Y. Shen, and T.-Y. Liu. Relational click prediction for sponsored search. In Proceedings of WSDM '12, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. W. Xu, E. Manavoglu, and E. Cantu-Paz. Temporal click model for sponsored search. In SIGIR '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. D. Yin, S. Guo, B. Chidlovskii, B. D. Davison, C. Archambeau, and G. Bouchard. Connecting comments and tags: Improved modeling of social tagging systems. In Proceedings of WSDM '13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. W. V. Zhang and R. Jones. Comparing click logs and editorial labels for training query rewriting. In Query Log Analysis: Social And Technological Challenges. A workshop at WWW 2007.Google ScholarGoogle Scholar
  43. Y. Zhang, W. Chen, D. Wang, and Q. Yang. User-click modeling for understanding and predicting search-behavior. In KDD '11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. J. Zhu, A. Ahmed, and E. P. Xing. Medlda: maximum margin supervised topic models for regression and classification. In Proceedings of ICML '09, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. J. Zhu and E. Xing. Sparse topical coding. In UAI '11, 2011.Google ScholarGoogle Scholar
  46. Z. A. Zhu, W. Chen, T. Minka, C. Zhu, and Z. Chen. A novel click model and its applications to online advertising. In WSDM '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Estimating ad group performance in 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
        WSDM '14: Proceedings of the 7th ACM international conference on Web search and data mining
        February 2014
        712 pages
        ISBN:9781450323512
        DOI:10.1145/2556195

        Copyright © 2014 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: 24 February 2014

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        WSDM '14 Paper Acceptance Rate64of355submissions,18%Overall Acceptance Rate498of2,863submissions,17%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader