ACM Home Page
Please provide us with feedback. Feedback
Predicting bounce rates in sponsored search advertisements
Full text MovMov (19:29),  PdfPdf (540 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Industrial track papers table of contents
Pages 1325-1334  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
D. Sculley  Google, Inc., Pittsburgh, PA, USA
Robert G. Malkin  Google, Inc., Pittsburgh, PA, USA
Sugato Basu  Google, Inc., Mountain View, CA, USA
Roberto J. Bayardo  Google, Inc., Mountain View, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 55,   Downloads (12 Months): 126,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

This paper explores an important and relatively unstudied quality measure of a sponsored search advertisement: bounce rate. The bounce rate of an ad can be informally defined as the fraction of users who click on the ad but almost immediately move on to other tasks. A high bounce rate can lead to poor advertiser return on investment, and suggests search engine users may be having a poor experience following the click. In this paper, we first provide quantitative analysis showing that bounce rate is an effective measure of user satisfaction. We then address the question, can we predict bounce rate by analyzing the features of the advertisement? An affirmative answer would allow advertisers and search engines to predict the effectiveness and quality of advertisements before they are shown. We propose solutions to this problem involving large-scale learning methods that leverage features drawn from ad creatives in addition to their keywords and landing pages.


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
7
 
8
B. Carterette and R. Jones. Evaluating search engines by modeling the relationship between relevance and clicks. In NIPS, 2007.
9
10
 
11
S. Deerwester, S. Dumais, T. Landuaer, G. Furnas, and R. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 1990.
 
12
O. Delalleau and Y. Bengio. Parallel stochastic gradient descent. In CIAR Summer School, Toronto, 2007.
 
13
W. A. Gale and G. Sampson. Good-turing frequency estimation without tears. J. of Quantitative Linguistics, 2:217--237, 1995.
14
 
15
16
 
17
A. Kaushik. Bounce rate as sexiest web metric ever. MarketingProfs, August 2007. http://www.marketingprofs.com/7/bounce-rate-sexiest-web-metric-ever-kaushik.asp?sp=1.
 
18
A. Kaushik. Excellent analytics tip 11: Measure effectiveness of your web pages. Occam's Razor (blog), May 2007. http://www.kaushik.net/avinash/2007/05/excellent-analytics-tip-11-measure-effectiveness-of-your-web-pages.html.
 
19
H. J. Kushner and G. G. Yin. Stochastic Approximation Algorithms and Applications. Springer-Verlag, 1997.
 
20
J. Langford, L. Li, and T. Zhang. Sparse online learning via truncated gradient. In NIPS, 2008.
 
21
22
23
24
 
25
J. Platt. Probabilistic outputs for support vector machines and comparisons to regularized likelihood models. In Advances in Large Margin Classifiers, pages 61--74. MIT Press, 1999.
26
27
28
 
29
30


Collaborative Colleagues:
D. Sculley: colleagues
Robert G. Malkin: colleagues
Sugato Basu: colleagues
Roberto J. Bayardo: colleagues