| Online expansion of rare queries for sponsored search |
| Full text |
Pdf
(785 KB)
|
Source
|
International World Wide Web Conference
archive
Proceedings of the 18th international conference on World wide web
table of contents
Madrid, Spain
SESSION: Search/session: ads and query expansion
table of contents
Pages 511-520
Year of Publication: 2009
ISBN:978-1-60558-487-4
|
|
Authors
|
|
Andrei Broder
|
Yahoo! Research, Santa Clara, CA, USA
|
|
Peter Ciccolo
|
Yahoo! Research, Santa Clara, CA, USA
|
|
Evgeniy Gabrilovich
|
Yahoo! Research, Santa Clara, CA, USA
|
|
Vanja Josifovski
|
Yahoo! Research, Santa Clara, CA, USA
|
|
Donald Metzler
|
Yahoo! Research, Santa Clara, CA, USA
|
|
Lance Riedel
|
Yahoo! Research, Santa Clara, CA, USA
|
|
Jeffrey Yuan
|
Yahoo! Research, Santa Clara, CA, USA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 30, Downloads (12 Months): 131, Citation Count: 1
|
|
|
ABSTRACT
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety of external resources, such as Web search results. While these expansion-based algorithms are highly effective, they are largely inefficient and cannot be applied in real-time. In practice, such algorithms are applied offline to popular queries, with the results of the expensive operations cached for fast access at query time. In this paper, we describe an efficient and effective approach for matching ads against rare queries that were not processed offline. The approach builds an expanded query representation by leveraging offline processing done for related popular queries. Our experimental results show that our approach significantly improves the effectiveness of advertising on rare queries with only a negligible increase in computational cost.
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
|
Bodo Billerbeck , Falk Scholer , Hugh E. Williams , Justin Zobel, Query expansion using associated queries, Proceedings of the twelfth international conference on Information and knowledge management, November 03-08, 2003, New Orleans, LA, USA
[doi> 10.1145/956863.956866]
|
 |
4
|
Andrei Broder , Massimiliano Ciaramita , Marcus Fontoura , Evgeniy Gabrilovich , Vanja Josifovski , Donald Metzler , Vanessa Murdock , Vassilis Plachouras, To swing or not to swing: learning when (not) to advertise, Proceeding of the 17th ACM conference on Information and knowledge management, October 26-30, 2008, Napa Valley, California, USA
[doi> 10.1145/1458082.1458216]
|
 |
5
|
Andrei Z. Broder , Peter Ciccolo , Marcus Fontoura , Evgeniy Gabrilovich , Vanja Josifovski , Lance Riedel, Search advertising using web relevance feedback, Proceeding of the 17th ACM conference on Information and knowledge management, October 26-30, 2008, Napa Valley, California, USA
[doi> 10.1145/1458082.1458217]
|
 |
6
|
|
| |
7
|
S. Cucerzan and E. Brill. Spelling correction as an iterative process that exploits the collective knowledge of web users. In Proceedings of Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 293--300, 2004.
|
 |
8
|
Hang Cui , Ji-Rong Wen , Jian-Yun Nie , Wei-Ying Ma, Probabilistic query expansion using query logs, Proceedings of the 11th international conference on World Wide Web, May 07-11, 2002, Honolulu, Hawaii, USA
[doi> 10.1145/511446.511489]
|
| |
9
|
S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391--407, 1990.
|
 |
10
|
|
| |
11
|
B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242--259, 2007.
|
| |
12
|
B. Efron and R. J. Tibshirani. An introduction to the Bootstrap., volume 57 of Monographs on Statistics and Applied Probability. Chapman and Hall, 1993.
|
 |
13
|
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
 |
17
|
|
 |
18
|
|
 |
19
|
|
| |
20
|
M. Porter. An algorithm for suffix stripping. Program, 14(3):130--137, 1980.
|
 |
21
|
Filip Radlinski , Andrei Broder , Peter Ciccolo , Evgeniy Gabrilovich , Vanja Josifovski , Lance Riedel, Optimizing relevance and revenue in ad search: a query substitution approach, Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, July 20-24, 2008, Singapore, Singapore
[doi> 10.1145/1390334.1390404]
|
 |
22
|
|
| |
23
|
|
| |
24
|
S. Robertson, S. Walker, S. Jones, M. M. Hancock-Beaulieu, and M. Gatford. Okapi at TREC-3. In Proc. 3rd Text REtrieval Conference, pages 109--126, 1994.
|
 |
25
|
|
| |
26
|
J. J. Rocchio. Relevance Feedback in Information Retrieval, pages 313---323. Prentice-Hall, 1971.
|
 |
27
|
|
| |
28
|
|
| |
29
|
|
| |
30
|
C. Wang, P. Zhang, R. Choi, and M. D. Eredita. Understanding consumers attitude toward advertising. In Proceedings of Americas Conference on Information Systems, pages 1143--1148, 2002.
|
 |
31
|
|
 |
32
|
|
CITED BY
|
|
Evgeniy Gabrilovich , Andrei Broder , Marcus Fontoura , Amruta Joshi , Vanja Josifovski , Lance Riedel , Tong Zhang, Classifying search queries using the Web as a source of knowledge, ACM Transactions on the Web (TWEB), v.3 n.2, p.1-28, April 2009
|
|