Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1526709.1526778 | WWW |
Keywords | Field | DocType |
query expansion,real time | Data mining,Web search query,World Wide Web,Information retrieval,Query expansion,Computer science,Cache,Web query classification,Spatial query,Database | Conference |
Citations | PageRank | References |
67 | 1.96 | 28 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrei Broder | 1 | 7357 | 920.20 |
| Peter Ciccolo | 2 | 206 | 7.73 |
| Evgeniy Gabrilovich | 3 | 4573 | 224.48 |
| Vanja Josifovski | 4 | 2265 | 148.84 |
| Donald Metzler | 5 | 3138 | 141.39 |
| Lance Riedel | 6 | 454 | 19.42 |
| Jeffrey Yuan | 7 | 67 | 1.96 |