ACM Home Page
Please provide us with feedback. Feedback
How much can behavioral targeting help online advertising?
Full text PdfPdf (3.34 MB)
Source
International World Wide Web Conference archive
Proceedings of the 18th international conference on World wide web table of contents
Madrid, Spain
SESSION: Internet monetization/session: web monetization table of contents
Pages 261-270  
Year of Publication: 2009
ISBN:978-1-60558-487-4
Authors
Jun Yan  Microsoft Research Asia, beijing, China
Ning Liu  Microsoft Research Asia, beijing, China
Gang Wang  Microsoft Research Asia, beijing, China
Wen Zhang  University of Science & Technology , HeFei, China
Yun Jiang  ShangHai Jiao Tong University , ShangHai, China
Zheng Chen  Microsoft Research Asia, Beijing, China
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 54,   Downloads (12 Months): 248,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1526709.1526745
What is a DOI?

ABSTRACT

Behavioral Targeting (BT) is a technique used by online advertisers to increase the effectiveness of their campaigns, and is playing an increasingly important role in the online advertising market. However, it is underexplored in academia when looking at how much BT can truly help online advertising in commercial search engines. To answer this question, in this paper we provide an empirical study on the click-through log of advertisements collected from a commercial search engine. From the comprehensively experiment results on the sponsored search log of the commercial search engine over a period of seven days, we can draw three important conclusions: (1) Users who clicked the same ad will truly have similar behaviors on the Web; (2) Click-Through Rate (CTR) of an ad can be averagely improved as high as 670% by properly segmenting users for behavioral targeted advertising in a sponsored search; (3) Using the short term user behaviors to represent users is more effective than using the long term user behaviors for BT. The statistical t-test verifies that all conclusions drawn in the paper are statistically significant. To the best of our knowledge, this work is the first empirical study for BT on the click-through log of real world ads.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
C. J. van Rijsbergen, S. E. Robertson and M. F. Porter. New models in probabilistic information retrieval. British Library Research and Development Report, No. 5587, 1980.
 
4
D. C. Fain and J. O. Pedersen. Sponsored search: a brief history. In Bulletin of the American Society for Information Science and Technology, 2005.
 
5
D.R. Cox and D.V. Hinkley. Theoretical statistics. Chapman and Hall, London, 1974.
 
6
G. Hripcsak and A.S. Rothschild. Agreement, the F--Measure, and reliability. Information Retrieval Journal of the American Medical Informatics Association, 2 (May 2005), 296--298.
 
7
G. Karypis. CLUTO: a software package for clustering high-Dimensional data sets. University of Minnesota, Dept. of Computer Science.
 
8
9
 
10
 
11
Adlink https://www.google.com/adsense/login/en_US/?gsessionid=Dc28hZShnCI
 
12
Specificmeida http://www.specificmedia.co.uk/
 
13
Almond Net http://www.almondnet.com/
 
14
Blue Lithium http://www.bluelithium.com/
 
15
 
16
Burst http://www.burstmedia.com/
 
17
Double Click http://www.doubleclick.com/products/dfa/index.aspx
 
18
NebuAd http://www.nebuad.com/
 
19
Phorm http://www.phorm.com/
 
20
Revenue Science http://www.revenuescience.com/advertisers/advertiser_solutions.asp
 
21
TACODA http://www.tacoda.com/
 
22
Yahoo! Smart Ads http://advertising.yahoo.com/marketing/smartads/


Collaborative Colleagues:
Jun Yan: colleagues
Ning Liu: colleagues
Gang Wang: colleagues
Wen Zhang: colleagues
Yun Jiang: colleagues
Zheng Chen: colleagues