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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
“Mad men”, as an expression, was coined in the late 1950s and refers to the people working on Madison Avenue, New York City in the advertising industry. It is also the name of a US AMC TV series that was first broadcast in 2007.
- 2.
Visited on February 15, 2011.
- 3.
Editor’s note: Section 2.1 reports that the indexed Web is estimated to contain at least 16.3 billion pages on the same date, thus, there is no contradiction.
- 4.
Section 2.4 uses “query processing throughput”.
- 5.
SEMs are advertising agencies that manage the search ad campaigns of large companies.
References
AdEx (2010) The definitive guide to the size and scale of European online advertising, 2009 report. http://www.iabeurope.eu, visited on December, 2010
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
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
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
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
Auer P, Cesa-Bianchi N, Fischer P (1985) Finite-time analysis of the multiarmed bandit problem. Machine Learning 47:235–256
Bellman R (2003) Dynamic Programming. Dover, New York, NY
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
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
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
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
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
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
Burns E (2010) SEMs sees optimization PPC. http://www.clickz.com/showPage.html?page=3550881, visited on February, 2011
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
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
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
Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning and Games. Cambridge University Press, New York, NY
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
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
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
Croft B, Metzler D, Strohman T (2009) Search Engines: Information Retrieval in Practice. Addison-Wesley, Reading, MA
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
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
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
Hill S, Provost F, Volinsky C (2006) Network-based marketing: Identifying likely adopters via consumer networks. Statistical Science 22:256–276
IAB (2009) Internet Advertising Revenue Report. Pricewaterhouse Coopers LLP. http://www.iab.net/insights_research/947883/adrevenuereport, visited on December, 2010
Järvelin K, Kekäläinen J (2002) Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems 20:422–446
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
Joachims T, Radlinski F (2007) Search engines that learn from implicit feedback. Computer 40:34–40
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
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
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
Lai T, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 4–22
Larose D (2004) Discovering Knowledge in Data: An Introduction to Data Mining. Wiley, New York, NY
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
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
Manning C, Raghavan P, Schütze H (2008b) Introduction to Information Retrieval. Cambridge University Press, New York, NY
Manning C, Raghavan P, Schütze H (2008a) Amazon mechanical turk. https://www.mturk.com/mturk/welcome, visited on December, 2010
Menzel H (1966) Uses in science and technology. Annual Review of Information Science and Technology 1:41–69
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
Niculescu-mizil A, Caruana R (2005) Predicting good probabilities with supervised learning. In: Proceedings of the International Conference on Machine Learning, pp 625–632
Ogilvy D (1983) Ogilvy on Advertising. Orbis, London
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
Platt J (1999) Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. Advances in Large Margin Classifiers 61–74
Rabiner L (1989a) Sort-merge join. http://en.wikipedia.org/wiki/Sort-merge_join, visited on December, 2010
Rabiner L (1989b) A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 257–286
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
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
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
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
Robertson T, WrighT F, Dykstra R (1989) Order restricted statistical inference. Statistical Papers 30:316–316
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
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
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
Vestergaard T, Schroder K (1985) The Language of Advertising. Blackwell
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
Witten I, Moffat A, Bell T (1999) Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, San Francisco, CA
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
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
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
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
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
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
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Shanahan, J.G., Kurra, G. (2011). Digital Advertising: An Information Scientist’s Perspective. In: Melucci, M., Baeza-Yates, R. (eds) Advanced Topics in Information Retrieval. The Information Retrieval Series, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20946-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-20946-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20945-1
Online ISBN: 978-3-642-20946-8
eBook Packages: Computer ScienceComputer Science (R0)