Machine learning for targeted display advertising: Transfer learning in action

Machine Learning

Volumn 95, Issue 1, 2014, Pages 103-127

  Perlich, C ^a   Dalessandro, B ^a   Raeder, T ^a   Stitelman, O ^a   Provost, F ^a,b  

^a M6D Research   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Display advertising; Predictive modeling; Transfer learning

Indexed keywords

IMPORTANCE SAMPLING; MARKETING;

ADVERTISING CAMPAIGN; DISPLAY ADVERTISINGS; EXPERIMENTAL EVALUATION; PREDICTIVE MODELING; PROBLEM FORMULATION; RESEARCH AND DEVELOPMENT; SAMPLING DISTRIBUTION; TRANSFER LEARNING;

LEARNING SYSTEMS;

EID: 84897110594     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-013-5375-2     Document Type: Article

References (27)

1. Agarwal, D., Agrawal, R., Khanna, R., & Kota, N. (2010). Estimating rates of rare events with multiple hierarchies through scalable log-linear models. In Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 213-222).
2. Attenberg, J., & Provost, F. (2010). Why label when you can search? Strategies for applying human resources to build classification models under extreme class imbalance. In Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining.
3. Attenberg, J., Ipeirotis, P., & Provost, F. (2011). Beat the machine: challenging workers to find the unknown unknowns. In Workshops at the 25th AAAI conference on artificial intelligence.
4. Bottou, L. (2010). Large-scale machine learning with stochastic gradient descent. In Proceedings of the 19th COMPSTAT international conference on computational statistics (pp. 177-187). Berlin: Springer.
5. Breiman, L. (1996). Stacked regressions. Machine Learning, 24(1), 49-64.
6. Chen, Y., Pavlov, D., & Canny, J. (2009). Large-scale behavioral targeting. In Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 209-218).
7. Dalessandro, B., Hook, R., Perlich, C., & Provost, F. (2012). Evaluating and optimizing online advertising: forget the click, but there are good proxies. NYU Working Paper CBA-12-02.
8. Evgeniou, T., & Pontil, M. (2004). Regularized multi-task learning. In Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 109-117). New York: ACM.
9. Fawcett, T., & Provost, F. (1997). Adaptive fraud detection. Data Mining and Knowledge Discovery, 1(3), 291-316.
10. Heskes, T. (1998). Solving a huge number of similar tasks: a combination of multi-task learning and a hierarchical Bayesian approach. In Proceedings of the 15th ICML international conference on machine learning (pp. 233-241).
11. Ipeirotis, P., Provost, F., & Wang, J. (2010). Quality management on amazon mechanical turk. In Proceedings of the ACM SIGKDD workshop on human computation (pp. 64-67).
12. Jensen, D., & Cohen, P. (2000). Multiple comparisons in induction algorithms. Machine Learning, 38(3), 309-338.
13. Liu, Y., Pandey, S., Agarwal, D., & Josifovski, V. (2012). Finding the right consumer: optimizing for conversion in display advertising campaigns. In Proceedings of the 5th ACM international conference on web search and data mining (pp. 473-482).
14. Pan, S., & Yang, Q. (2010). A survey on transfer learning. IEEE Transactions on Knowledge and Data Engineering, 22(10), 1345-1359.
15. Pandey, S., Aly, M., Bagherjeiran, A., Hatch, A., Ciccolo, P., Ratnaparkhi, A., & Zinkevich, M. (2011). Learning to target: what works for behavioral targeting. In Proceedings of 20th ACM CIKM conference on information and knowledge management (pp. 1805-1814).
16. Perlich, C., Dalessandro, B., Hook, R., Stitelman, O., Raeder, T., & Provost, F. (2012). Bid optimizing and inventory scoring in targeted online advertising. In Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 804-812). New York: ACM.
17. Provost, F., & Kohavi, R. (1998). Guest editors' introduction: on applied research in machine learning. Machine Learning, 30(2), 127-132.
18. Provost, F., Dalessandro, B., Hook, R., Zhang, X., & Murray, A. (2009). Audience selection for on-line brand advertising: privacy-friendly social network targeting. In Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 707-716).
19. Raeder, T., Dalessandro, B., Stitelman, O., Perlich, C., & Provost, F. (2012). Design principles of massive, robust prediction systems. In Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining.
20. Rosset, S., & Lawrence, R. (2006). Data enhanced predictive modeling for sales targeting. In Proceedings of SIAM conference on data mining.
21. Singer, N. (2012). Your online attention, bought in an instant. The New York Times. November 17, 2012
22. Stitelman, O., Dalessandro, B., Perlich, C., & Provost, F. (2011). Estimating the effect of online display advertising on browser conversion. In Proceedings of the workshop on data mining and audience intelligence for online advertising at ACM SIGKDD.
23. Weinberger, K., Dasgupta, A., Langford, J., Smola, A., & Attenberg, J. (2009). Feature hashing for large scale multitask learning. In Proceedings of the 26th ICML international conference on machine learning (pp. 1113-1120). New York: ACM.
24. Weiss, G., & Provost, F. (2003). Learning when training data are costly: the effect of class distribution on tree induction. Journal of Artificial Intelligence Research, 19, 315-354.
25. Xue, Y., Liao, X., Carin, L., & Krishnapuram, B. (2007). Multi-task learning for classification with Dirichlet process priors. Journal of Machine Learning Research, 8, 35-63.
26. Zadrozny, B. (2004). Learning and evaluating classifiers under sample selection bias. In Proceedings of the 25th ICML international conference on machine learning (p. 114). New York: ACM.
27. Zou, H., & Hastie, T. (2005). Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society. Series B. Statistical Methodology, 67(2), 301-320.