Abstract
To participate in sponsored search online advertising, an advertiser bids on a set of keywords relevant to his/her product or service. When one of these keywords matches a user search string, the ad is then considered for display among sponsored search results. Advertisers compete for positions in which their ads appear, as higher slots typically result in more user clicks. All existing position allocating mechanisms charge more per click for a higher slot. Therefore, an advertiser must decide whether to bid high and receive more, but more expensive, clicks.
In this work, we propose a novel methodology for building forecasting landscapes relating an individual advertiser bid to the expected click-through rate and/or the expected daily click volume. Displaying such landscapes is currently offered as a service to advertisers by all major search engine providers. Such landscapes are expected to be instrumental in helping the advertisers devise their bidding strategies.
We propose a triply monotone regression methodology. We start by applying the current state-of-the-art monotone regression solution. We then propose to condition on the ad position and to estimate the bid-position and position-click effects separately. While the latter translates into a standard monotone regression problem, we devise a novel solution to the former based on approximate maximum likelihood. We show that our proposal significantly outperforms the standard monotone regression solution, while the latter similarly improves upon routinely used ad-hoc methods.
Last, we discuss other e-commerce applications of the proposed intermediate variable regression methodology.
- Abrams, Z., Mendelevich, O., and Tomlin, J. A. 2007. Optimal delivery of sponsored search advertisements subject to budget constraints. In Proceedings of the 9th Conference on Electronic Commerce. ACM, 272--278. Google Scholar
Digital Library
- Altendorf, E. E., Restificar, A. C., and Dietterich, T. G. 2005. Learning from sparse data by exploiting monotonicity constraints. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence. 18--26.Google Scholar
- Barlow, R. E., Bartholomew, D. J., Bremner, J. M., and Brunk, H. D. 1972. Statistical Inference under Order Restrictions. Wiley, New York.Google Scholar
- Chakrabarty, D., Zhou, Y., and Lukose, R. 2007. Budget constrained bidding in keyword auctions and online knapsack problems. In Proceedings of the Workshop on Sponsored Search Auctions (Poster).Google Scholar
- Coleman, T. F. and Li, Y. 1996. An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optimiz. 6, 418--445.Google Scholar
Digital Library
- Dash, D. and Cooper, G. F. 2004. Model averaging for prediction with discrete Bayesian networks. J. Mach. Learn. Resear. 5, 1177--1203. Google Scholar
Digital Library
- Edelman, B., Ostrovsky, M., and Schwarz, M. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. Amer. Econ. Rev. 97, 1, 242--259.Google Scholar
Cross Ref
- Elidan G., Nachman, I., and Friedman, N. 2007. Ideal parent structure learning for continuous variable Bayesian networks. J. Mach. Learn. Resear. 8, 1799--1833. Google Scholar
Digital Library
- Feldman, J., Muthukrishnan, S., Pal, M., and Stein, C. 2007. Budget optimization in search-based advertising auctions. In Proceedings of the 9th Conference on Electronic Commerce. ACM, 40--49. Google Scholar
Digital Library
- Gluhovsky, I. 2006. Smooth isotonic additive interaction models with application to computer system architecture design. Technometrics 48, 2, 176--192.Google Scholar
Cross Ref
- Gluhovsky, I. 2009. Customer behavior model for quality-of-service environments with many service levels. J. Electron. Comm. Resear. 10, 1, 29--41.Google Scholar
- Gluhovsky, I. and Gluhovsky, A. 2007. Smooth location dependent bandwidth selection for local polynomial regression. J. Amer. Statis. Ass. 102, 478, 718--725.Google Scholar
- Gluhovsky, I. and Vengerov, D. 2007. Constrained multivariate extrapolation models with application to computer cache rates. Technometrics 49, 2, 129--137.Google Scholar
Cross Ref
- Hastie, T. J., Tibshirani, R. J., and Friedman, J. H. 2001. Elements of Statistical Learning. Springer-Verlag.Google Scholar
- Heckerman, D., Geiger, D., and Chickering, D. 1995. Learning Bayesian networks: The combination of knowledge and statistical data. Mach. Learn. 20, 197--243. Google Scholar
Digital Library
- Mehta, A., Saberi, A., Vazirani, U., and Vazirani, V. 2005. Adwords and the generalized bipartite matching problem. In Proceedings of the Symposium on the Foundations of Computer Science. 264--273. Google Scholar
Digital Library
- Ramsay, J. O. 1988. Monotone regression splines in action. Statist. Sci. 3, 425--461.Google Scholar
Cross Ref
- Regelson, M. and Fain, D. C. 2006. Predicting click-through rate using keyword clusters. In Proceedings of the 2nd Workshop on Sponsored Search Auctions. ACM.Google Scholar
- Richardson, M., Dominowska, E., and Ragno, R. 2007. Predicting clicks: estimating the click-through rate for new ads. In Proceedings of the 16th International Conference on World Wide Web. 521--529. Google Scholar
Digital Library
- Sha, F., Saul, L., and Lee, D. D. 2003. Multiplicative updates for non-negative quadratic programming in support vector machines. Tech. rep. MS-CIS-02-19, Univ. of Pennsylvania.Google Scholar
- van der Gaag, L. C., Bodlaender, H. L., and Feelders, A. 2004. Monotonicity in Bayesian networks. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence. 569--576. Google Scholar
Digital Library
Index Terms
Forecasting Click-Through Rates Based on Sponsored Search Advertiser Bids and Intermediate Variable Regression
Recommendations
A predictive model for advertiser value-per-click in sponsored search
WWW '13: Proceedings of the 22nd international conference on World Wide WebSponsored search is a form of online advertising where advertisers bid for placement next to search engine results for specific keywords. As search engines compete for the growing share of online ad spend, it becomes important for them to understand ...
Joint optimization of bid and budget allocation in sponsored search
KDD '12: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data miningThis paper is concerned with the joint allocation of bid price and campaign budget in sponsored search. In this application, an advertiser can create a number of campaigns and set a budget for each of them. In a campaign, he/she can further create ...
Conversion rate based bid adjustment for sponsored search
WWW '10: Proceedings of the 19th international conference on World wide webAdvertisers use Sponsored Search to drive traffic to their site at a conversion rate and cost per conversion that provides value to them. However, very often advertisers bid at a constant price on a bundle of keywords, either for lack of enough data to ...






Comments