An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
The budgeted maximum coverage problem
Information Processing Letters
Agglomerative clustering of a search engine query log
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Generating query substitutions
Proceedings of the 15th international conference on World Wide Web
Query rewriting using active learning for sponsored search
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Query suggestion based on user landing pages
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
Proceedings of the 9th ACM conference on Electronic commerce
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Rewriting null e-commerce queries to recommend products
Proceedings of the 21st international conference companion on World Wide Web
Automatic suggestion of query-rewrite rules for enterprise search
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Multi-label learning with millions of labels: recommending advertiser bid phrases for web pages
Proceedings of the 22nd international conference on World Wide Web
| Hi-index | 0.00 |
We consider the problem of query rewrites in the context of pay-per-click search advertising. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that can be served for the rewrites, we formulate a family of graph covering problems whose goals are to suggest a subset of ads with the maximum benefit by suggesting rewrites for a given query. We obtain constant-factor approximation algorithms for these covering problems, under two versions of constraints and a realistic notion of ad benefit. We perform experiments on real data and show that our algorithms are capable of outperforming a competitive baseline algorithm in terms of the benefit of the rewrites.