ACM Home Page
Please provide us with feedback. Feedback
Contextual advertising by combining relevance with click feedback
Full text PdfPdf (491 KB)
Source
International World Wide Web Conference archive
Proceeding of the 17th international conference on World Wide Web table of contents
Beijing, China
SESSION: Search: ranking and retrieval enhancement table of contents
Pages 417-426  
Year of Publication: 2008
ISBN:978-1-60558-085-2
Authors
Deepayan Chakrabarti  Yahoo! Research, Sunnyvale, CA, USA
Deepak Agarwal  Yahoo! Research, Sunnyvale, CA, USA
Vanja Josifovski  Yahoo! Research, Sunnyvale, CA, USA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 217,   Citation Count: 6
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/1367497.1367554
What is a DOI?

ABSTRACT

Contextual advertising supports much of the Web's ecosystem today. User experience and revenue (shared by the site publisher and the ad network) depend on the relevance of the displayed ads to the page content. As with other document retrieval systems, relevance is provided by scoring the match between individual ads (documents) and the content of the page where the ads are shown (query). In this paper we show how this match can be improved significantly by augmenting the ad-page scoring function with extra parameters from a logistic regression model on the words in the pages and ads. A key property of the proposed model is that it can be mapped to standard cosine similarity matching and is suitable for efficient and scalable implementation over inverted indexes. The model parameter values are learnt from logs containing ad impressions and clicks, with shrinkage estimators being used to combat sparsity. To scale our computations to train on an extremely large training corpus consisting of several gigabytes of data, we parallelize our fitting algorithm in a Hadoop framework [10]. Experimental evaluation is provided showing improved click prediction over a holdout set of impression and click events from a large scale real-world ad placement engine. Our best model achieves a 25% lift in precision relative to a traditional information retrieval model which is based on cosine similarity, for recalling 10% of the clicks in our test data.


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
 
4
5
 
6
C. R. Rao. Linear Statistical Inference and its Applications. Wiley-Interscience, 2002.
 
7
 
8
S. Derksen and H. J. Keselman. Backward, forward and stepwise automated subset selection algorithms: Frequency of obtaining authentic and noise variables. British Journal of Mathematical and Statistical Psychology, 45:265--282, 1992.
 
9
Online ad spending to total $19.5 billion in 2007. eMarketer, February 2007. Available from http://www.emarketer.com/Article.aspx?id=1004635.
 
10
A. Foundation. Apache hadoop project. In lucene.apache.org/hadoop.
 
11
G. King and L. Zeng. Logistic regression in rare events data. Political Analysis, 9:137--162, 2001.
 
12
13
 
14
P. McCullagh and J. A. Nelder. Generalized Linear Models. Chapman and Hall, 1989.
 
15
M. J. Silvapulle. On the existence of maximum likelihood estimates for the binomial response models. Journal of the Royal Statistical Society, Series B, 43:310--313, 1981.
 
16
 
17
M. Regelson and D. Fain. Predicting click-through rate using keyword clusters. In In Proc. of the Second Workshop on Sponsored Search Auctions, 2006.
18
19
 
20
 
21
C. Wang, P. Zhang, R. Choi, and M. D. Eredita. Understanding consumers attitude toward advertising. In Eighth Americas conf. on Information System, pages 1143--1148, 2002.
22

CITED BY  6

Collaborative Colleagues:
Deepayan Chakrabarti: colleagues
Deepak Agarwal: colleagues
Vanja Josifovski: colleagues