Predicting winning price in real time bidding with censored data

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2015-August, Issue , 2015, Pages 1305-1314

  Wu, Wush Chi Hsuan ^a   Yeh, Mi Yen ^b   Chen, Ming Syan ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Demand Side Platform; Display advertising; Learning with partial labels; Real time bidding

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA MINING; ECONOMICS; FORECASTING; LEARNING SYSTEMS; MIXTURES; REGRESSION ANALYSIS; STATISTICS;

CENSORED DATA; CENSORED REGRESSION; DEMAND-SIDE; DISPLAY ADVERTISINGS; MIXTURE MODEL; PREDICTION ACCURACY; REAL TIME; SURVIVAL ANALYSIS;

COSTS;

EID: 84954185682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2783258.2783276     Document Type: Conference Paper

References (21)

1. T. Brambor, W. R. Clark, and M. Golder. Understanding interaction models. improving empirical analyses. Political Analysis, 14:63-82, 2006.
2. R. H. Byrd, P. Lu, J. Nocedal, and C. Zhu. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput., 16(5):1190-1208, Sept. 1995.
3. O. Chapelle. Modeling delayed feedback in display advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'14, pages 1097-1105, New York, NY, USA, 2014. ACM.
4. Y. Cui, R. Zhang, W. Li, and J. Mao. Bid landscape forecasting in online ad exchange marketplace. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'11, pages 265-273, New York, NY, USA, 2011. ACM.
5. J. Feldman, M. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein. Online stochastic packing applied to display ad allocation. In M. de Berg and U. Meyer, editors, ESA (1), Volume 6346 of Lecture Notes in Computer Science, pages 182-194. Springer, 2010.
6. J. Feldman, A. Mehta, V. Mirrokni, and S. Muthukrishnan. Online stochastic matching: Beating 1-1/e. In Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS'09, pages 117-126, Washington, DC, USA, 2009. IEEE Computer Society.
7. A. Ghosh, B. I. Rubinstein, S. Vassilvitskii, and M. Zinkevich. Adaptive bidding for display advertising. In Proceedings of the 18th International Conference on World Wide Web, WWW'09, pages 251-260, New York, NY, USA, 2009. ACM.
8. Google. The arrival of real-time bidding. 2011.
9. W. H. Greene. Censored data and truncated distributions. Working papers, New York University, Leonard N. Stern School of Business, Department of Economics, 2005.
10. X. He, J. Pan, O. Jin, T. Xu, B. Liu, T. Xu, Y. Shi, A. Atallah, R. Herbrich, S. Bowers, and J. Q. Candela. Practical lessons from predicting clicks on ads at facebook. In Proceedings of the Eighth International Workshop on Data Mining for Online Advertising, ADKDD 2014, August 24, 2014, New York City, New York, USA, pages 1-9, 2014.
11. R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, STOC'90, pages 352-358, New York, NY, USA, 1990. ACM.
12. J. Klein and M. Moeschberger. Survival Analysis: Techniques for Censored and Truncated Data. Statistics for Biology and Health. Springer, 2003.
13. H. B. McMahan, G. Holt, D. Sculley, M. Young, D. Ebner, J. Grady, L. Nie, T. Phillips, E. Davydov, D. Golovin, S. Chikkerur, D. Liu, M. Wattenberg, A. M. Hrafnkelsson, T. Boulos, and J. Kubica. Ad click prediction: a view from the trenches. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2013.
14. J. Reisinger and M. Driscoll. Pricing externalities in real-time bidding markets. In NIPS 2010 Workshop: Machine Learning in Online ADvertising, 2010.
15. W. Schnedler. Likelihood estimation for censored random vectors. Working Papers 0417, University of Heidelberg, Department of Economics, Feb. 2005.
16. J. Tobin. Estimation of relationships for limited dependent variables. Cowles Foundation Discussion Papers 3R, Cowles Foundation for Research in Economics, Yale University, 1956.
17. J. Wang, S. Shen, and S. Seljan. Real-time bidding: A new frontier of computational advertising research. Workshop in CIKM, 11 2013.
18. K. Weinberger, A. Dasgupta, J. Langford, A. Smola, and J. Attenberg. Feature hashing for large scale multitask learning. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML'09, pages 1113-1120, New York, NY, USA, 2009. ACM.
19. S. Yuan, J. Wang, and X. Zhao. Real-time bidding for online advertising: Measurement and analysis. CoRR, abs/1306.6542, 2013.
20. W. Zhang, S. Yuan, and J. Wang. Optimal real-time bidding for display advertising. In The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'14, New York, NY, USA - August 24-27, 2014, pages 1077-1086, 2014.
21. W. Zhang, S. Yuan, J. Wang, and X. Shen. Real-time bidding benchmarking with ipinyou dataset. arXiv preprint arXiv:1407.7073, 2014.