ACM Home Page
Please provide us with feedback. Feedback
Learning to advertise
Full text PdfPdf (378 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Seattle, Washington, USA
SESSION: Web IR: current topics table of contents
Pages: 549 - 556  
Year of Publication: 2006
ISBN:1-59593-369-7
Authors
Anísio Lacerda  Federal Univ. of Minas Gerais, Belo Horizonte, Brazil
Marco Cristo  Federal Univ. of Minas Gerais, Belo Horizonte, Brazil
Marcos André Gonçalves  Federal Univ. of Minas Gerais, Belo Horizonte, Brazil
Weiguo Fan  Virginia Tech, Blacksburg, VA
Nivio Ziviani  Federal Univ. of Minas Gerais, Belo Horizonte, Brazil
Berthier Ribeiro-Neto  Federal Univ. of Minas Gerais, Belo Horizonte, Brazil and Google Engineering Belo, Belo Horizonte, Brazil
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 37,   Downloads (12 Months): 281,   Citation Count: 20
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/1148170.1148265
What is a DOI?

ABSTRACT

Content-targeted advertising, the task of automatically associating ads to a Web page, constitutes a key Web monetization strategy nowadays. Further, it introduces new challenging technical problems and raises interesting questions. For instance, how to design ranking functions able to satisfy conflicting goals such as selecting advertisements (ads) that are relevant to the users and suitable and profitable to the publishers and advertisers? In this paper we propose a new framework for associating ads with web pages based on Genetic Programming (GP). Our GP method aims at learning functions that select the most appropriate ads, given the contents of a Web page. These ranking functions are designed to optimize overall precision and minimize the number of misplacements. By using a real ad collection and web pages from a newspaper, we obtained a gain over a state-of-the-art baseline method of 61.7% in average precision. Further, by evolving individuals to provide good ranking estimations, GP was able to discover ranking functions that are very effective in placing ads in web pages while avoiding irrelevant ones.


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
J. J. Carrasco, D. Fain, K. Lang, and L. Zhukov. Clustering of bipartite advertiser-keyword graph. In Workshop on Clustering Large Datasets, 3th IEEE International Conference on Data Mining, Melbourne, Florida, USA, November 2003. IEEE Computer Society Press. Available at http://research.yahoo.com/publications.xml .
 
4
O. Cordon, F. Moya, and C. Zarco. A new evolutionary algorithm combining simulated annealing and genetic programming for relevance feedback in fuzzy information retrieval systems. Soft Computing-A Fusion of Foundations, Methodologies and Applications, 6(5): 308--319, Aug. 2002.
 
5
E. Eneva. Detecting invalid clicks in online paid search listings: a problem description for the use of unlabeled data. In T. Fawcett and N. Mishra, editors, Workshop on the Continuum from Labeled to Unlabeled Data, 20th International Conference on Machine Learning, Washington DC, USA, August 2003. AAAI Press.
 
6
 
7
 
8
 
9
W. Fan, M. D. Gordon, and P. Pathak. Genetic programming-based discovery of ranking functions for effective web search. Journal of Management Information Systems, 21(4): 37--56, Spring 2005.
 
10
 
11
J. Feng, H. Bhargava, and D. Pennock. Implementing paid placement in Web search engines: computational evaluation of alternative mechanisms. INFORMS Journal on Computing, 2006. To be published.
 
12
13
 
14
M. D. Gordon. User-based document clustering by redescribing subject descriptions with a genetic algorithm. JASIS, 42(5): 311--322, 1991.
 
15
D. K. Harman. Overview of the fourth text retrieval conference TREC-4. In D. K. Harman, editor, Proceedings of the Fourth Text REtrieval Conference (TREC-4), pages 1--24, Gaithersburg, Maryland, USA, November 1996. NIST Special Publication 500--236.
 
16
D. Hawking, N. Craswell, and P. B. Thistlewaite. Overview of TREC-7 very large collection track. In The Seventh Text REtrieval Conference (TREC-7), pages 91--104, Gaithersburg, Maryland, USA, November 1998.
 
17
 
18
IAB and PricewaterhouseCoopers. IAB internet advertising revenue report, April 2005. Available at http://www.iab.net/2004adrevenues.
 
19
 
20
 
21
K. Lee. The SEM content conundrum. ClickZ Experts, July 2003. Available at http://www.clickz.com/experts/search/strat/article.php/2233821.
 
22
 
23
K. Maddox. Forrester reports advertising shift to online, May 2005. Available at http://www.btobonline.com/article.cms?articleId=24191.
 
24
T. M. Mitchell. Machine learning. McGraw Hill, New York, US, 1996.
 
25
OneUpWeb. How keyword length affects conversion rates, January 2005. Available at http://www.oneupweb.com/landing/keywordstudy_landing.htm .
 
26
 
27
P. Pathak, M. Gordon, and W. Fan. Effective information retrieval using genetic algorithms based matching function adaptation. In Proceedings of the 33rd Hawaii International Conference on System Science, Hawaii, USA, 2000.
28
 
29
M. Weideman. Ethical issues on content distribution to digital consumers via paid placement as opposed to website visibility in search engine results. In The 17th ETHICOMP, pages 904--915. Troubador Publishing Ltd, April 2004.
 
30
31

CITED BY  20

Collaborative Colleagues:
Anísio Lacerda: colleagues
Marco Cristo: colleagues
Marcos André Gonçalves: colleagues
Weiguo Fan: colleagues
Nivio Ziviani: colleagues
Berthier Ribeiro-Neto: colleagues