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

Optimized Cost per Click in Taobao Display Advertising

Published:13 August 2017Publication History

ABSTRACT

Taobao, as the largest online retail platform in the world, provides billions of online display advertising impressions for millions of advertisers every day. For commercial purposes, the advertisers bid for specific spots and target crowds to compete for business traffic. The platform chooses the most suitable ads to display in tens of milliseconds. Common pricing methods include cost per mille (CPM) and cost per click (CPC). Traditional advertising systems target certain traits of users and ad placements with fixed bids, essentially regarded as coarse-grained matching of bid and traffic quality. However, the fixed bids set by the advertisers competing for different quality requests cannot fully optimize the advertisers' key requirements. Moreover, the platform has to be responsible for the business revenue and user experience. Thus, we proposed a bid optimizing strategy called optimized cost per click (OCPC) which automatically adjusts the bid to achieve finer matching of bid and traffic quality of page view (PV) request granularity. Our approach optimizes advertisers' demands, platform business revenue and user experience and as a whole improves traffic allocation efficiency. We have validated our approach in Taobao display advertising system in production. The online A/B test shows our algorithm yields substantially better results than previous fixed bid manner.

References

  1. Gagan Aggarwal, Ashish Goel, and Rajeev Motwani. 2006. Truthful auctions for pricing search keywords. In Proceedings of the 7th ACM conference on Electronic commerce. ACM, 1--7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Junxuan Chen, Baigui Sun, Hao Li, Hongtao Lu, and Xian-Sheng Hua 2016. Deep CTR Prediction in Display Advertising. In Proceedings of the 2016 ACM on Multimedia Conference. ACM, 811--820. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Heng-Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, et almbox. 2016. Wide & deep learning for recommender systems. In Proceedings of the 1st Workshop on Deep Learning for Recommender Systems. ACM, 7--10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. The American economic review Vol. 97, 1 (2007), 242--259. Google ScholarGoogle ScholarCross RefCross Ref
  5. David S Evans. 2009. The online advertising industry: Economics, evolution, and privacy. The journal of economic perspectives Vol. 23, 3 (2009), 37--60. Google ScholarGoogle ScholarCross RefCross Ref
  6. Facebook 2012. Cost per Actoin and Optimized Cost Per Mille. developers.facebook.com (2012).Google ScholarGoogle Scholar
  7. Kun Gai, Xiaoqiang Zhu, Han Li, Kai Liu, and Zhe Wang 2017. Learning Piece-wise Linear Models from Large Scale Data for Ad Click Prediction. arXiv preprint arXiv:1704.05194 (2017).Google ScholarGoogle Scholar
  8. Avi Goldfarb and Catherine Tucker 2011. Online display advertising: Targeting and obtrusiveness. Marketing Science, Vol. 30, 3 (2011), 389--404. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Google 2010. Enhanced Cost per Click in Google AdWords. https://support.google.com/adwords/answer/2464964 (2010).Google ScholarGoogle Scholar
  10. Thore Graepel, Joaquin Q Candela, Thomas Borchert, and Ralf Herbrich 2010. Web-scale bayesian click-through rate prediction for sponsored search advertising in microsoft's bing search engine. In Proceedings of the 27th International Conference on Machine Learning (ICML-10). 13--20.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Xinran He, Junfeng Pan, Ou Jin, Tianbing Xu, Bo Liu, Tao Xu, Yanxin Shi, Antoine Atallah, Ralf Herbrich, Stuart Bowers, et almbox. 2014. Practical lessons from predicting clicks on ads at facebook Proceedings of the Eighth International Workshop on Data Mining for Online Advertising. ACM, 1--9.Google ScholarGoogle Scholar
  12. Chinmay Karande, Aranyak Mehta, and Ramakrishnan Srikant. 2013. Optimizing budget constrained spend in search advertising Proceedings of the sixth ACM international conference on Web search and data mining. ACM, 697--706.Google ScholarGoogle Scholar
  13. Sébastien Lahaie, David M Pennock, Amin Saberi, and Rakesh V Vohra 2007. Sponsored search auctions. Algorithmic game theory (2007), 699--716.Google ScholarGoogle Scholar
  14. S Muthukrishnan. 2010. Data Mining Problems in Internet Ad Systems.. In COMAD. 9.Google ScholarGoogle Scholar
  15. Claudia Perlich, Brian Dalessandro, Rod Hook, Ori Stitelman, Troy Raeder, and Foster Provost. 2012. Bid optimizing and inventory scoring in targeted online advertising Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 804--812.Google ScholarGoogle Scholar
  16. Foster Provost, Brian Dalessandro, Rod Hook, Xiaohan Zhang, and Alan Murray 2009. Audience selection for on-line brand advertising: privacy-friendly social network targeting Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 707--716.Google ScholarGoogle Scholar
  17. Troy Raeder, Ori Stitelman, Brian Dalessandro, Claudia Perlich, and Foster Provost. 2012. Design principles of massive, robust prediction systems Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, 1357--1365.Google ScholarGoogle Scholar
  18. Matthew Richardson, Ewa Dominowska, and Robert Ragno. 2007. Predicting clicks: estimating the click-through rate for new ads Proceedings of the 16th international conference on World Wide Web. ACM, 521--530.Google ScholarGoogle Scholar
  19. J Ben Schafer, Dan Frankowski, Jon Herlocker, and Shilad Sen 2007. Collaborative filtering recommender systems. The adaptive web. Springer, 291--324.Google ScholarGoogle Scholar
  20. Hal R Varian. 2007. Position auctions. international Journal of industrial Organization, Vol. 25, 6 (2007), 1163--1178.Google ScholarGoogle Scholar
  21. Shuai Yuan, Jun Wang, Bowei Chen, Peter Mason, and Sam Seljan 2014. An empirical study of reserve price optimisation in real-time bidding Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 1897--1906.Google ScholarGoogle Scholar
  22. Shuai Yuan, Jun Wang, and Xiaoxue Zhao 2013. Real-time bidding for online advertising: measurement and analysis Proceedings of the Seventh International Workshop on Data Mining for Online Advertising. ACM, 3.Google ScholarGoogle Scholar
  23. Yong Yuan, Feiyue Wang, Juanjuan Li, and Rui Qin. 2014natexlabb. A survey on real time bidding advertising. In IEEE International Conference on Service Operations and Logistics, and Informatics. 418--423.Google ScholarGoogle Scholar
  24. Weinan Zhang, Shuai Yuan, and Jun Wang 2014. Optimal real-time bidding for display advertising. Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 1077--1086. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Weinan Zhang, Tianxiong Zhou, Jun Wang, and Jian Xu. 2016. Bid-aware Gradient Descent for Unbiased Learning with Censored Data in Display Advertising Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. 665--674.Google ScholarGoogle Scholar

Index Terms

  1. Optimized Cost per Click in Taobao Display Advertising

      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
        KDD '17: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
        August 2017
        2240 pages
        ISBN:9781450348874
        DOI:10.1145/3097983

        Copyright © 2017 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: 13 August 2017

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        KDD '17 Paper Acceptance Rate64of748submissions,9%Overall Acceptance Rate1,133of8,635submissions,13%

        Upcoming Conference

        KDD '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader