Position-normalized click prediction in search advertising

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

Volumn , Issue , 2012, Pages 795-803

  Chen, Ye ^a   Yan, Tak W ^a  

^a MICROSOFT   (United States)

Author keywords

exogeneity; factor models; search advertising

Indexed keywords

CLICK-THROUGH RATE; CLICKTHROUGH DATA; EXOGENEITY; FACTOR MODEL; MODEL ASSUMPTIONS; PREDICTION ACCURACY; PROBABILISTIC FACTORS; SPONSORED SEARCHES;

DATA MINING; FORECASTING;

MARKETING;

EID: 84866013062     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339654     Document Type: Conference Paper

References (13)

1. D. Agarwal, R. Agrawal, R. Khanna, and N. Kota. Estimating rates of rare events with multiple hierarchies through scalable log-linear models. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), pages 213-222, 2010.
2. S. Athey and D. Nekipelov. A structural model of sponsored search advertising auctions. Proceedings of the 6th Ad Auctions Workshop, 2010.
3. O. Chapelle and Y. Zhang. A dynamic Bayesian network click model for web search ranking. Proceedings of the 18th International Conference on World Wide Web (WWW 2009), pages 1-10, 2009.
4. Y. Chen, M. Kapralov, D. Pavlov, and J. F. Canny. Factor modeling for advertisement targeting. Advances in Neural Information Processing Systems (NIPS 2009), 22:324-332, 2009.
5. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. Proceedings of the First ACM International Conference on Web Search and Data Mining (WSDM 2008), pages 87-94, 2008.
6. 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:242-259, 2005.
7. 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. Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pages 13-20, 2010.
8. D. Hillard, E. Manavoglu, H. Raghavan, C. Leggetter, E. Cantú-Paz, and R. Iyer. The sum of its parts: reducing sparsity in click estimation with query segments. Information Retrieval, 14:315-336, 2011.
9. H. Ishwaran and J. Rao. Spike and slab variable selection: frequentist and Bayesian strategies. Annals of Statistics, 33(2):730-773, 2005.
10. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems (NIPS 2000), 13:556-562, 2000.
11. F. Pin and P. Key. Stochastic variability in sponsored search auctions: observations and models. Proceedings of the 12th ACM Conference on Electronic Commerce (EC 2011), pages 61-70, 2011.
12. M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. Proceedings of the 16th International Conference on World Wide Web (WWW 2007), pages 521-530, 2007.
13. W. V. Zhang and R. Jones. Comparing click logs and editorial labels for training query rewriting. WWW 2007 Workshop on Query Log Analysis: Social And Technological Challenges, 2007.