Sciweavers

Share
SIGIR
2010
ACM

Estimating advertisability of tail queries for sponsored search

11 years 3 months ago
Estimating advertisability of tail queries for sponsored search
Sponsored search is one of the major sources of revenue for search engines on the World Wide Web. It has been observed that while showing ads for every query maximizes shortterm revenue, irrelevant ads lead to poor user experience and less revenue in the long-term. Hence, it is in search engines’ interest to place ads only for queries that are likely to attract ad-clicks. Many algorithms for estimating query advertisability exist in literature, but most of these methods have been proposed for and tested on the frequent or “head” queries. Since query frequencies on search engine are known to be distributed as a power-law, this leaves a huge fraction of the queries uncovered. In this paper we focus on the more challenging problem of estimating query advertisability for infrequent or “tail” queries. These require fundamentally different methods than head queries: for e.g., tail queries are almost all unique and require the estimation method to be online and inexpensive. We sho...
Sandeep Pandey, Kunal Punera, Marcus Fontoura, Van
Added 16 Aug 2010
Updated 16 Aug 2010
Type Conference
Year 2010
Where SIGIR
Authors Sandeep Pandey, Kunal Punera, Marcus Fontoura, Vanja Josifovski
Comments (0)
books