Functional Bid Landscape Forecasting for Display Advertising

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9851)


Real-time auction has become an important online advertising trading mechanism. A crucial issue for advertisers is to model the market competition, i.e., bid landscape forecasting. It is formulated as predicting the market price distribution for each ad auction provided by its side information. Existing solutions mainly focus on parameterized heuristic forms of the market price distribution and learn the parameters to fit the data. In this paper, we present a functional bid landscape forecasting method to automatically learn the function mapping from each ad auction features to the market price distribution without any assumption about the functional form. Specifically, to deal with the categorical feature input, we propose a novel decision tree model with a node splitting scheme by attribute value clustering. Furthermore, to deal with the problem of right-censored market price observations, we propose to incorporate a survival model into tree learning and prediction, which largely reduces the model bias. The experiments on real-world data demonstrate that our models achieve substantial performance gains over previous work in various metrics. The software related to this paper is available at


Market Price Leaf Node Bidding Strategy Tree Depth Online Advertising 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Agarwal, D., Ghosh, S., Wei, K., You, S.: Budget pacing for targeted online advertisements at linkedin. In: KDD (2014)Google Scholar
  2. 2.
    Amin, K., Kearns, M., Key, P., Schwaighofer, A.: Budget optimization for sponsored search: Censored learning in mdps. arXiv preprint arXiv:1210.4847 (2012)
  3. 3.
    Cui, Y., Zhang, R., Li, W., Mao, J.: Bid landscape forecasting in online ad exchange marketplace. In: KDD (2011)Google Scholar
  4. 4.
    Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Technical report, National Bureau of Economic Research (2005)Google Scholar
  5. 5.
    Faddoul, J.B., Chidlovskii, B., Gilleron, R., Torre, F.: Learning multiple tasks with boosted decision trees. In: Flach, P.A., Bie, T., Cristianini, N. (eds.) ECML PKDD 2012. LNCS (LNAI), pp. 681–696. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-33460-3_49 Google Scholar
  6. 6.
    García-Laencina, P.J., Sancho-Gómez, J.L., Figueiras-Vidal, A.R.: Pattern classification with missing data: a review. Neural Comput. Appl. 19(2), 263–282 (2010)CrossRefGoogle Scholar
  7. 7.
    Google: The arrival of real-time bidding (2011)Google Scholar
  8. 8.
    Johnson, N.L.: Survival Models and Data Analysis. Wiley, New York (1999)zbMATHGoogle Scholar
  9. 9.
    Kaplan, E.L., Meier, P.: Nonparametric estimation from incomplete observations. J. Am. Stat. Assoc. 53, 457–481 (1958)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kullback, S.: Letter to the editor: the kullback-leibler distance (1987)Google Scholar
  11. 11.
    Lee, K.C., Jalali, A., Dasdan, A.: Real time bid optimization with smooth budget delivery in online advertising. In: ADKDD (2013)Google Scholar
  12. 12.
    Lee, K.c., Orten, B.B., Dasdan, A., Li, W.: Estimating conversion rate in display advertising from past performance data (2012)Google Scholar
  13. 13.
    Liao, H., Peng, L., Liu, Z., Shen, X.: ipinyou global rtb bidding algorithm competition dataset. In: ADKDD (2014)Google Scholar
  14. 14.
    Marlin, B.M., Zemel, R.S.: Collaborative prediction and ranking with non-random missing data. In: RecSys (2009)Google Scholar
  15. 15.
    Pan, R., Zhou, Y., Cao, B., Liu, N.N., Lukose, R., Scholz, M., Yang, Q.: One-class collaborative filtering. In: ICDM (2008)Google Scholar
  16. 16.
    Perlich, C., Dalessandro, B., Hook, R., Stitelman, O., Raeder, T., Provost, F.: Bid optimizing and inventory scoring in targeted online advertising. In: KDD (2012)Google Scholar
  17. 17.
    Stojanova, D., Ceci, M., Appice, A., Džeroski, S.: Network regression with predictive clustering trees. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), pp. 333–348. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-23808-6_22 CrossRefGoogle Scholar
  18. 18.
    Wu, W.C.H., Yeh, M.Y., Chen, M.S.: Predicting winning price in real time bidding with censored data. In: KDD (2015)Google Scholar
  19. 19.
    Yuan, S., Wang, J., Chen, B., Mason, P., Seljan, S.: An empirical study of reserve price optimisation in real-time bidding. In: KDD (2014)Google Scholar
  20. 20.
    Yuan, S., Wang, J., Zhao, X.: Real-time bidding for online advertising: measurement and analysis. In: ADKDD (2013)Google Scholar
  21. 21.
    Zhang, W., Wang, J.: Statistical arbitrage mining for display advertising. In: KDD (2015)Google Scholar
  22. 22.
    Zhang, W., Yuan, S., Wang, J.: Optimal real-time bidding for display advertising. In: KDD (2014)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Shanghai Jiao Tong UniversityShanghaiChina
  2. 2.University College LondonLondonUK

Personalised recommendations