The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Predicting clicks: estimating the click-through rate for new ads
Abstract
Search engine advertising has become a significant element of the Web browsing experience. Choosing the right ads for the query and the order in which they are displayed greatly affects the probability that a user will see and click on each ad. This ranking has a strong impact on the revenue the search engine receives from the ads. Further, showing the user an ad that they prefer to click on improves user satisfaction. For these reasons, it is important to be able to accurately estimate the click-through rate of ads in the system. For ads that have been displayed repeatedly, this is empirically measurable, but for new ads, other means must be used. We show that we can use features of ads, terms, and advertisers to learn a model that accurately predicts the click-though rate for new ads. We also show that using our model improves the convergence and performance of an advertising system. As a result, our model increases both revenue and user satisfaction.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Accessibility of information on the web
Lawrence, S., & Giles, C. L. (1999) · Nature · doi:10.1038/21987 · Cited by 1,349
Improving web search ranking by incorporating user behavior information
Agichtein, E., Brill, E., & Dumais, S. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148177 · Cited by 1,041
Lawrence, S., & Giles, C. L. (1998) · Science · doi:10.1126/science.280.5360.98 · Cited by 969
Feng, J., Bhargava, H. K., & Pennock, D. M. (2007) · INFORMS Journal on Computing · doi:10.1287/ijoc.1050.0135 · Cited by 278
Research works printed but not linked: 2
- L. Baker , " Google vs. Yahoo: Earnings Reports Comparison ," In Search Engine Journal http://www.searchengine-journal.com/?p=3923. L. Baker, "Google vs. Yahoo: Earnings Reports Comparison," In Search Engine Journal http://www.searchengine-journal.com/?p=3923.
- K. Bartz , V. Murthi , S. Sebastian , "Logistic Regression and Collaborative Filtering for Sponsored Search Term Recommendation" , In Proceedings of the Second Workshop on Sponsored Search Auctions , 2006 . K. Bartz, V. Murthi, S. Sebastian, "Logistic Regression and Collaborative Filtering for Sponsored Search Term Recommendation", In Proceedings of the Second Workshop on Sponsored Search Auctions, 2006.
Cited by
LightGBM: A Highly Efficient Gradient Boosting Decision Tree
(2017) · HAL · Cited by 10,512
DeepFM: A Factorization-Machine based Neural Network for CTR Prediction
Guo, H., TANG, R., Ye, Y., Li, Z., & He, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/239 · Cited by 2,538
xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems
Lian, J., Zhou, X., Zhang, F., Chen, Z., Xie, X., & Sun, G. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220023 · Cited by 1,040
Deep Neural Networks and Tabular Data: A Survey
Borisov, V., Leemann, T., Seßler, K., Haug, J., Pawelczyk, M., & Kasneci, G. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3229161 · Cited by 1,025
Predicting the popularity of online content
Szabo, G., & Huberman, B. A. (2010) · Communications of the ACM · doi:10.1145/1787234.1787254 · Cited by 983
Metadata
- Authors
- Richardson, M., Dominowska, E., & Ragno, R.
- Affiliations
- Microsoft (United States) (US)
- Venue
- Proceedings of the 16th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2007-05-08
- Pages
- 521-530
- OpenAlex
- W2090883204
- Cited by
- 1,049
- References
- 16
- Citations by year
- 2026: 35 · 2025: 54 · 2024: 64 · 2023: 74 · 2022: 73 · 2021: 71 · 2020: 90 · 2019: 66 · 2018: 55 · 2017: 71 · 2016: 47 · 2015: 51 · 2014: 56 · 2013: 43 · 2012: 42
- FWCI
- 27.83
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International World Wide Web Conference (WWW) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
- Keywords
- search engine advertising, click-through rate prediction, ad ranking, advertising revenue, user satisfaction, online learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Predicting clicks: estimating the click-through rate for new ads. https://app.cochat.ai/papers/10.1145/1242572.1242643
- The paper
- Richardson, M., Dominowska, E., & Ragno, R. (2007). Predicting clicks: estimating the click-through rate for new ads. Proceedings of the 16th international conference on World Wide Web. https://doi.org/10.1145/1242572.1242643
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.