Digital Advertising: An Information Scientist’s Perspective

Part of the The Information Retrieval Series book series (INRE, volume 33)

Abstract

Digital online advertising is a form of promotion that uses the Internet and Web for the express purpose of delivering marketing messages to attract customers. Examples of online advertising include text ads that appear on search engine results pages, banner ads, in-text ads, or Rich Media ads that appear on regular web pages, portals, or applications. Over the past 15 years online advertising, a $65 billion industry worldwide in 2009, has been pivotal to the success of the Web. That being said, the field of advertising has been equally revolutionized by the Internet, Web, and more recently, by the emergence of the social web, and mobile devices. This success has arisen largely from the transformation of the advertising industry from a low-tech, human intensive, “Mad Men” way of doing work to highly optimized, quantitative, mathematical, computer- and data-centric processes that enable highly targeted, personalized, performance-based advertising. This chapter provides a clear and detailed overview of the technologies and business models that are transforming the field of online advertising primarily from statistical machine learning and information science perspectives.

References

  1. AdEx (2010) The definitive guide to the size and scale of European online advertising, 2009 report. http://www.iabeurope.eu, visited on December, 2010
  2. Agarwal D, Chen B (2010) FLDA: Matrix factorization through latent Dirichlet allocation. In: Proceedings of the ACM Conference on Web Search and Data Mining. ACM Press, New York, NY, pp 91–100 CrossRefGoogle Scholar
  3. Agarwal D, Chen B, Elango P (2009) Explore/exploit schemes for web content optimization. In: Proceedings of the International Conference on Data Mining, pp 1–10 Google Scholar
  4. Anagnostopoulos A, Broder A, Gabrilovich E, Josifovski V, Riedel L (2007a) The combined impact of search and online display advertising—why advertisers should measure across channels. http://www.atlassolutions.com/uploadedFiles/Atlas/Atlas_Institute/Published_Content/crosschanneldmi.pdf, visited on December, 2010
  5. Anagnostopoulos A, Broder A, Gabrilovich E, Josifovski V, Riedel L (2007b) Just-in-time contextual advertising. In: Proceedings of the ACM Conference on Information and Knowledge Management. ACM Press, New York, NY, pp 331–340 Google Scholar
  6. Auer P, Cesa-Bianchi N, Fischer P (1985) Finite-time analysis of the multiarmed bandit problem. Machine Learning 47:235–256 CrossRefGoogle Scholar
  7. Bellman R (2003) Dynamic Programming. Dover, New York, NY MATHGoogle Scholar
  8. Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30(1–7):107–117 CrossRefGoogle Scholar
  9. Broder A, Carmel D, Herscovici M, Soffer A, Zien J (2003a) Efficient query evaluation using a two-level retrieval process. In: Proceedings of the ACM Conference on Information and Knowledge Management. ACM Press, New York, NY, pp 426–434 Google Scholar
  10. Broder A, Fontoura M, Josifovski V, Riedel L (2007a) Internet advertising bureau. about the IAB. http://www.iab.net/about_the_iab, visited on December, 2010
  11. Broder A, Fontoura M, Gabrilovich E, Joshi A, Josifovski V, Zhang T (2007b) Robust classification of rare queries using web knowledge. In: Proceedings of the ACM Conference on Research and Development in Information Retrieval. ACM Press, New York, NY, pp 231–238 Google Scholar
  12. Broder A, Fontoura M, Josifovski V, Riedel L (2007c) A semantic approach to contextual advertising. In: Proceedings of the ACM Conference on Research and Development in Information Retrieval. ACM Press, New York, NY, pp 559–566 Google Scholar
  13. Broder A, Ciaramita M, Fontoura M, Gabrilovich E, Josifovski V, Metzler D, Murdock V, Plachouras V (2008) To swing or not to swing: Learning when (not) to advertise. In: Proceedings of the ACM Conference on Information and Knowledge Management. ACM Press, New York, NY, pp 1003–1012 Google Scholar
  14. Burns E (2010) SEMs sees optimization PPC. http://www.clickz.com/showPage.html?page=3550881, visited on February, 2011
  15. Cao Z, Liu T (2007) Learning to rank: From pairwise approach to listwise approach. In: Proceedings of the International Conference on Machine Learning, pp 129–136 Google Scholar
  16. Carrasco J, Fain D, Lang K, Zhukov L (2003) Clustering of bipartite advertiser-keyword graph. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.8969&rep=rep1&type=pdf, visited on February, 2011
  17. Carterette B, Kanoulas E, Yilmaz E (2010b) Low cost evaluation in information retrieval. In: Proceedings of the ACM Conference on Research and Development in Information Retrieval. ACM Press, New York, NY, p 903 Google Scholar
  18. Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning and Games. Cambridge University Press, New York, NY MATHCrossRefGoogle Scholar
  19. Chapelle O, Metlzer D, Zhang Y, Grinspan P (2009) Expected reciprocal rank for graded relevance. In: Proceedings of the ACM Conference on Information and Knowledge Management. ACM Press, New York, NY, pp 621–630 CrossRefGoogle Scholar
  20. Chen Y, Pavlov D, Canny J (2009) Large-scale behavioral targeting. In: Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. ACM Press, New York, NY, pp 209–218 CrossRefGoogle Scholar
  21. Ciaramita M, Murdock V, Plachouras V (2008) Online learning from click data for sponsored search. In: Proceedings of the International Conference on the World Wide Web. ACM Press, New York, NY, pp 227–236 Google Scholar
  22. Croft B, Metzler D, Strohman T (2009) Search Engines: Information Retrieval in Practice. Addison-Wesley, Reading, MA Google Scholar
  23. Edelman B, Ostrovsky M, Schwarz M (2005) Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. http://www.aeaweb.org/articles.php?doi=10.1257/aer.97.1.242, visited on February, 2011
  24. Goodman J, Carvalho V (2005) Implicit queries for email. http://research.microsoft.com/en-us/um/people/joshuago/ceas05-fixed.pdf, visited on February, 2011
  25. Grefenstette G, Shanahan J (2005) Document souls: Joining personalities to documents to produce proactive documents engaged in contextualized, independent search. http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-151/CIR-05_2.pdf, visited on February, 2011
  26. Hill S, Provost F, Volinsky C (2006) Network-based marketing: Identifying likely adopters via consumer networks. Statistical Science 22:256–276 MathSciNetCrossRefGoogle Scholar
  27. IAB (2009) Internet Advertising Revenue Report. Pricewaterhouse Coopers LLP. http://www.iab.net/insights_research/947883/adrevenuereport, visited on December, 2010
  28. Järvelin K, Kekäläinen J (2002) Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems 20:422–446 CrossRefGoogle Scholar
  29. Joachims T (2002) Optimizing search engines using clickthrough data. In: Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. ACM Press, New York, NY, pp 133–142 Google Scholar
  30. Joachims T, Radlinski F (2007) Search engines that learn from implicit feedback. Computer 40:34–40 CrossRefGoogle Scholar
  31. Katz S (1987) Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics, Speech and Signal Processing 400–401 Google Scholar
  32. Khan I (2010) Nothing but net. https://mm.jpmorgan.com/stp/t/c.do?i=3c571-1cf&u=a_p*d_254466.pdf*h_1v23jmle, visited on February, 2011
  33. Lacerda A, Cristo M, Goncalves M, Fan W, Ziviani N, Ribeiro-Neto B (2006) Learning to advertise. In: Proceedings of the ACM Conference on Research and Development in Information Retrieval. ACM Press, New York, NY, pp 549–556 Google Scholar
  34. Lai T, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 4–22 Google Scholar
  35. Larose D (2004) Discovering Knowledge in Data: An Introduction to Data Mining. Wiley, New York, NY Google Scholar
  36. Levin A, Levin I, Weller J (2005) A multi-attribute analysis of preferences for online and offline shopping: Differences across products and consumers and shopping stages. Journal of Electronic Commerce Research 281–290 Google Scholar
  37. Li L, Chu W, Langford J (2010) An unbiased and data-driven, offline evaluation method of contextual bandit algorithms. Tech rep, CoRR. abs/1003.5956. http://arxiv.org/abs/1003.5956, visited on December, 2010
  38. Manning C, Raghavan P, Schütze H (2008b) Introduction to Information Retrieval. Cambridge University Press, New York, NY MATHGoogle Scholar
  39. Manning C, Raghavan P, Schütze H (2008a) Amazon mechanical turk. https://www.mturk.com/mturk/welcome, visited on December, 2010
  40. Menzel H (1966) Uses in science and technology. Annual Review of Information Science and Technology 1:41–69 Google Scholar
  41. Murdock V, Ciaramita M, Plachouras V (2007) A noisy-channel approach to contextual advertising. In: Proceedings of the International Workshop on Data Mining and Audience Intelligence for Advertising. ACM Press, New York, NY, pp 21–27 CrossRefGoogle Scholar
  42. Niculescu-mizil A, Caruana R (2005) Predicting good probabilities with supervised learning. In: Proceedings of the International Conference on Machine Learning, pp 625–632 Google Scholar
  43. Ogilvy D (1983) Ogilvy on Advertising. Orbis, London Google Scholar
  44. Pandey S, Agarwal D, Chakrabarti D, Josifovski V (2007) Bandits for taxonomies: A model-based approach. http://www.siam.org/proceedings/datamining/2007/dm07_020pandey.pdf, visited on February, 2011
  45. Platt J (1999) Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. Advances in Large Margin Classifiers 61–74 Google Scholar
  46. Rabiner L (1989a) Sort-merge join. http://en.wikipedia.org/wiki/Sort-merge_join, visited on December, 2010
  47. Rabiner L (1989b) A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 257–286 Google Scholar
  48. Ravi S, Broder AZ, Gabrilovich E, Josifovski V, Pandey S, Pang B (2010) Automatic generation of bid phrases for online advertising. In: Proceedings of the ACM Conference on Web Search and Data Mining. ACM Press, New York, NY, pp 341–350 CrossRefGoogle Scholar
  49. Regelson M, Fain D (2006) Predicting click-through rate using keyword clusters. http://web.archive.org/web/20060716120359/www.bus.ualberta.ca/kasdemir/ssa2/regelson_fain.pdf, visited on February, 2011
  50. Ribeiro-Neto B, Cristo M, Golgher P, de Moura ES (2005) Impedance coupling in content-targeted advertising. In: Proceedings of the ACM Conference on Research and Development in Information Retrieval. ACM Press, New York, NY, pp 496–503 Google Scholar
  51. Richardson M, Dominowska E, Ragno R (2007) Predicting clicks: Estimating the click-through rate for new ads. In: Proceedings of the International Conference on the World Wide Web, pp 521–530 CrossRefGoogle Scholar
  52. Robertson T, WrighT F, Dykstra R (1989) Order restricted statistical inference. Statistical Papers 30:316–316 CrossRefGoogle Scholar
  53. Rocchio J (1971) Relevance feedback in Information Retrieval. In: Salton G (ed) The SMART Retrieval System. Prentice Hall/Englewood Cliffs, New York, NY, pp 313–323 Google Scholar
  54. Shanahan J, den Poel DV (2010a) Determining optimal advertisement frequency capping policy via Markov decision processes to maximize click through rates. http://research.microsoft.com/en-us/um/beijing/events/mload-2010/nips-mload-2010-poster-shanahan-camerareadyposter.pdf, visited on February, 2011
  55. Shanahan J, den Poel DV (2010b) Google to offer ads based on interests. http://www.nytimes.com/2009/03/11/technology/internet/11google.html, visited on December, 2010
  56. Vestergaard T, Schroder K (1985) The Language of Advertising. Blackwell Google Scholar
  57. Wang X, Broder AZ, Fontoura M, Josifovski V (2009) A search-based method for forecasting ad impression in contextual advertising. http://www2009.eprints.org/50/, visited on February, 2011
  58. Witten I, Moffat A, Bell T (1999) Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, San Francisco, CA Google Scholar
  59. Wu H, Qiu G, He X, Shi Y, Qu M, Shen J, Bu J, Chen C (2009) Advertising keyword generation using active learning. In: Proceedings of the International Conference on the World Wide Web, pp 1095–1096 CrossRefGoogle Scholar
  60. Yan J, Liu N, Wang G, Zhang W, Jiang Y, Chen Z (2009c) How much can behavioral targeting help online advertising? In: Proceedings of the International Conference on the World Wide Web. ACM Press, New York, NY, pp 261–270 CrossRefGoogle Scholar
  61. Yih W (2006) Finding advertising keywords on web pages. In: Proceedings of the International Conference on the World Wide Web. ACM Press, New York, NY, pp 213–222 CrossRefGoogle Scholar
  62. Yu K, Bi J, Tresp V (2006) Active learning via transductive experimental design. In: Proceedings of the International Conference on Machine Learning. ACM Press, New York, NY, pp 1081–1088 Google Scholar
  63. Zadrozny B, Elkan C (2001) Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In: Proceedings of the International Conference on Machine Learning. Morgan Kaufmann, San Diego, CA, pp 609–616 Google Scholar
  64. Zhou L, Dai L, Zhang D (2007) Online shopping acceptance model—a critical survey of consumer factors in online shopping. Journal of Electronic Commerce Research 8:41–61 Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Independent ConsultantSan FranciscoUSA
  2. 2.Turn Inc.San FranciscoUSA

Personalised recommendations