ACM Home Page
Please provide us with feedback. Feedback
Efficient query expansion for advertisement search
Full text PdfPdf (1.26 MB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval table of contents
Boston, MA, USA
SESSION: Expansion and feedback table of contents
Pages 51-58  
Year of Publication: 2009
ISBN:978-1-60558-483-6
Authors
Haofen Wang  Shanghai Jiao Tong University, Shanghai, China
Yan Liang  Shanghai Jiao Tong University, Shanghai, China
Linyun Fu  Shanghai Jiao Tong University, Shanghai, China
Gui-Rong Xue  Shanghai Jiao Tong University, Shanghai, China
Yong Yu  Shanghai Jiao Tong University, Shanghai, China
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 108,   Downloads (12 Months): 328,   Citation Count: 0
Additional Information:

abstract   references   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/1571941.1571953
What is a DOI?

ABSTRACT

Online advertising represents a growing part of the revenues of major Internet service providers such as Google and Yahoo. A commonly used strategy is to place advertisements (ads) on the search result pages according to the users' submitted queries. Relevant ads are likely to be clicked by a user and to increase the revenues of both advertisers and publishers. However, bid phrases defined by ad-owners are usually contained in limited number of ads. Directly matching user queries with bid phrases often results in finding few appropriate ads. To address this shortcoming, query expansion is often used to increase the chances to match the ads. Nevertheless, query expansion on top of the traditional inverted index faces efficiency issues such as high time complexity and heavy I/O costs. Moreover, precision cannot always be improved, sometimes even hurt due to the involvement of additional noise.

In this paper, we propose an efficient ad search solution relying on a block-based index able to tackle the issues associated with query expansion. Our index structure places clusters of similar bid phrases in corresponding blocks with their associated ads. It reduces the number of merge operations significantly during query expansion and allows sequential scans rather than random accesses, saving I/O costs. We adopt flexible block sizes according to the clustering results of bid phrases to further optimize the index structure for efficient ad search. The pre-computation of such clusters is achieved through an agglomerative iterative clustering algorithm. Finally, we adapt the spreading activation mechanism to return the top-k relevant ads, improving search precision. The experimental results of our prototype, AdSearch, show that we can indeed return a larger number of relevant ads without sacrificing execution speed.


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
9
 
10
J.J. Carrasco, D.C. Fain, K.J. Lang, and L. Zhukov. Clustering of bipartite advertiser-keyword graph. In ICDM, 2003.
11
12
 
13
14
15
 
16
P. Jaccard. Étude comparative de la distribution florale dans une portion des alpes et des jura. Bulletin del la Société Vaudoise des Sciences Naturelles, 37:547--579, 1901.
 
17
B.J. Jansen. Adversarial information retrieval aspects of sponsored search. In AIRWeb, 2006.
18
19
20
 
21
C. Wang, P. Zhang, R. Choi, and M. D'Eredita. Understanding consumers attitude towards advertising. In AMCIS, 2002.
22

Collaborative Colleagues:
Haofen Wang: colleagues
Yan Liang: colleagues
Linyun Fu: colleagues
Gui-Rong Xue: colleagues
Yong Yu: colleagues