The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Simple and Scalable Response Prediction for Display Advertising
Abstract
Clickthrough and conversation rates estimation are two core predictions tasks in display advertising. We present in this article a machine learning framework based on logistic regression that is specifically designed to tackle the specifics of display advertising. The resulting system has the following characteristics: It is easy to implement and deploy, it is highly scalable (we have trained it on terabytes of data), and it provides models with state-of-the-art accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1967) · Cited by 23,719
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Data Analysis Using Regression and Multilevel/Hierarchical Models
Gelman, A., & Hill, J. (2006) · doi:10.1017/cbo9780511790942 · Cited by 13,597
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
(2010) · Cited by 8,261
(2006) · Springer eBooks · Cited by 8,123
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Proceedings of the 25th international conference on Machine learning
Cohen, W. W., McCallum, A., & Roweis, S. T. (2008) · Cited by 5,691
Logistic Regression in Rare Events Data
King, G., & Zeng, L. (2001) · Political Analysis · doi:10.1093/oxfordjournals.pan.a004868 · Cited by 4,316
Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J. H., McCauley, M., Franklin, M. J. M., Shenker, S. J., & Stoica, I. G. (2012) · Cited by 3,622
Applied Logistic Regression Analysis
(1996) · Technometrics · doi:10.1080/00401706.1996.10484485 · Cited by 3,598
Applied Logistic Regression Analysis
Menard, S. (2002) · Sage eBooks · doi:10.4135/9781412983433 · Cited by 2,989
Updating quasi-Newton matrices with limited storage
Nocedal, J. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0572855-7 · Cited by 2,958
THOMPSON, W. R. (1933) · Biometrika · doi:10.1093/biomet/25.3-4.285 · Cited by 2,712
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772758 · Cited by 2,562
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
An empirical study of smoothing techniques for language modeling
Chen, S. F., & Goodman, J. (1999) · Computer Speech & Language · doi:10.1006/csla.1999.0128 · Cited by 2,066
Proceedings of the 6th Berkeley Symposium on Mathematical Statistics and Probability
Cam, L. M. L., Neyman, J., & Scott, E. L. (1972) · Medical Entomology and Zoology · Cited by 1,679
The Group Lasso for Logistic Regression
Meier, L., Van De Geer, S., & Bühlmann, P. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00627.x · Cited by 1,674
Regularized multi--task learning
Evgeniou, T., & Pontil, M. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014067 · Cited by 1,433
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
(2011) · Cited by 1,000
Multi-Armed Bandit Allocation Indices.
Bather, J. A., & Gittins, J. C. (1990) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982809 · Cited by 998
Feature hashing for large scale multitask learning
Weinberger, K., Dasgupta, A., Langford, J., Smola, A., & Attenberg, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553516 · Cited by 906
Using Maximum Entropy for Text Classification
Nigam, K., Lafferty, J., & McCallum, A. (1999) · Cited by 781
Optimization with Sparsity-Inducing Penalties
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2025) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000015 · Cited by 730
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1998) · Journal of the ACM · doi:10.1145/293347.293351 · Cited by 665
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Chang, Y.-W., Hsieh, C., Chang, K., Ringgaard, M., & Lin, C. (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1859899 · Cited by 472
(2010) · Cited by 444
Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms
Li, L., Chu, W., Langford, J., & Wang, X. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935878 · Cited by 443
Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Feamster, N., & Mogul, J. (2013) · Cited by 355
Stochastic gradient boosted distributed decision trees
Ye, J., Chow, J.-H., Chen, J., & Zheng, Z. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646301 · Cited by 324
A Reliable Effective Terascale Linear Learning System
Agarwal, A., Chapelle, O., Dudı́k, M., & Langford, J. C. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.4198 · Cited by 260
Self-citation28th Conference on Uncertainty in Artificial Intelligence
Dibangoye, J., Amato, C., & Doniec, A. (2012) · HAL Portal Artxiker (Hindustan Aeronautics Limited (India)) · Cited by 236
A comparison of numerical optimizers for logistic regression
Minka, T. P. (2004) · Cited by 235
Adaptive bound optimization for online convex optimization
McMahan, H. B., & Streeter, M. (2010) · arXiv · doi:10.48550/arxiv.1002.4908 · Cited by 227
Learning Bounds for Importance Weighting
Cortes, C., Mansour, Y., & Mohri, M. (2010) · Cited by 205
Hash Kernels for Structured Data
Shi, Q., PettersonJames, Dror, G., Langford, J. C., & Smola, A. J. (2009) · ANU Open Research (Australian National University) · doi:10.5555/1577069.1755873 · Cited by 194
Muthukrishnan, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10841-9_1 · Cited by 191
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167200 · Cited by 173
A scalable modular convex solver for regularized risk minimization
Teo, C. H., Smola, A., Vishwanathan, S. V. N., & Le, Q. V. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281270 · Cited by 171
Contextual advertising by combining relevance with click feedback
Chakrabarti, D., Agarwal, D., & Josifovski, V. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367554 · Cited by 150
Response prediction using collaborative filtering with hierarchies and side-information
Menon, A. K., Chitrapura, K. P., Garg, S. K., Agarwal, D., & Kota, N. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020436 · Cited by 137
Predicting Click-Through Rate Using Keyword Clusters
Regelson, M., & Fain, D. C. (2006) · Cited by 113
Improving ad relevance in sponsored search
Hillard, D., Schroedl, S., Manavoglu, E., Raghavan, H., & Leggetter, C. (2010) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1718487.1718532 · Cited by 99
Self-citationEstimating rates of rare events with multiple hierarchies through scalable log-linear models
Agarwal, D., Agrawal, R., Khanna, R., & Kota, N. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835834 · Cited by 95
Online learning from click data for sponsored search
Ciaramita, M., Murdock, V., & Plachouras, V. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367529 · Cited by 94
Infinitely Imbalanced Logistic Regression
Owen, A. B. (2007) · doi:10.5555/1248659.1248686 · Cited by 94
Post-click conversion modeling and analysis for non-guaranteed delivery display advertising
Rosales, R., Cheng, H., & Manavoglu, E. (2012) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2124295.2124333 · Cited by 74
Self-citationOne-Armed Bandit Problems with Covariates
Sarkar, J. (1991) · The Annals of Statistics · doi:10.1214/aos/1176348382 · Cited by 51
The Design of Advertising Exchanges
McAfee, R. P. (2011) · Review of Industrial Organization · doi:10.1007/s11151-011-9300-1 · Cited by 41
The sum of its parts: reducing sparsity in click estimation with query segments
Hillard, D., Manavoglu, E., Raghavan, H., Leggetter, C., Cantú‐Paz, E., & Iyer, R. (2011) · Information Retrieval · doi:10.1007/s10791-010-9152-6 · Cited by 35
Self-citationEstimating Ad Clickthrough Rate through Query Intent Analysis
Ashkan, A., Clarke, C. L. A., Agichtein, E., & Guo, Q. (2009) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wi-iat.2009.39 · Cited by 20
Cited by
Deep & Cross Network for Ad Click Predictions
Wang, R., Fu, B., Fu, G., & Wang, M. (2017) · Proceedings of the ADKDD'17 · doi:10.1145/3124749.3124754 · Cited by 1,161
CatBoost: unbiased boosting with categorical features
Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A. V., & Gulin, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.09516 · Cited by 1,110
Field-aware Factorization Machines for CTR Prediction
Juan, Y., Zhuang, Y., Chin, W.-S., & Lin, C.-J. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959134 · Cited by 712
A Reliable Effective Terascale Linear Learning System
Agarwal, A., Chapelle, O., Dudı́k, M., & Langford, J. C. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.4198 · Cited by 260
Self-citationIdentifying machine learning techniques for classification of target advertising
Choi, J.-A., & Lim, K. (2020) · ICT Express · doi:10.1016/j.icte.2020.04.012 · Cited by 139
Metadata
- Authors
- Chapelle, O., Manavoglu, E., & Rosales, R.
- Venue
- ACM Transactions on Intelligent Systems and Technology
- Published
- 2014-12-29
- Volume
- 5
- Issue
- 4
- Pages
- 1-34
- ISSN
- 2157-6904 (ISSN-L)
- 2157-6912
- OpenAlex
- W1985759455
- Cited by
- 318
- References
- 58
- FWCI
- 68.42
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.