Azarakhsh Malekian
ABSTRACT
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.
- I. Antonellis, H. G. Molina, C--C. Chang. Simrank: Query rewriting through link analysis of the click graph. Stanford Computer Science Department Technical Report, 2007.Google Scholar
- D. Beeferman, A. Berger. Agglomerative clustering of a search engine query log. In Proc. 6th KDD, pages 407--416, 2000. Google ScholarDigital Library
- J. Breese, D. Heckerman, C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. 14th UAI, pages 43--52, 1998. Google ScholarDigital Library
- S. Cucerzan, R. W. White. Query suggestion based on user landing pages. In Proc. 30th SIGIR, pages 875--876, 2007. Google ScholarDigital Library
- S. C. Deerwester, S. T. Dumais, T. K. Lancaster, G. W. Furnas, R. A. Harshman. Indexing by latent semantic analysis. In JASIS, 41(6):391--407, 1990.Google ScholarCross Ref
- D. Fain, J. Pedersen. Sponsored search. In Bulletin of the American Society for Information Science and Technology, 2005.Google Scholar
- U. Feige, V. Mirrokni, J. Vondrak. Maximizing non--monotone submodular functions. In phProc. 48th FOCS, pages 461--471, 2007. Google ScholarDigital Library
- L. K. Fleisher, M. X. Goemans, V. S. Mirrokni, M. Sviridenko. Tight approximation algorithms for maximum general assignment problems. In phProc. 17th SODA, pages 611--620, 2006. Google ScholarDigital Library
- P. Goundan, A. Schulz. Revisiting the greedy approach to submodular set function maximization. In phManuscript, 2007.Google Scholar
- J. Herlocker, J. Konstan, A. Borchers, J. Riedl. An algorithmic framework for performing collaborative filtering. In Proc. 22nd SIGIR, pages 230--237, 1999. Google ScholarDigital Library
- D. S. Hochbaum, A. Pathria. Analysis of the greedy approach in covering problems. Unpublished, 1994.Google Scholar
- G. Jeh, J. Widom. Simrank: A measure of structural-context similarity. In Proc. 8th KDD, pages 538--543, 2002. Google ScholarDigital Library
- R. Jones, B. Rey, O. Madani, W. Greiner. Generating query substitutions. In Proc. 15th WWW, pages 387--396, 2006. Google ScholarDigital Library
- S. Khot, R. Lipton, E. Markakis, A. Mehta. Inapproximability results for combinatorial auctions with submodular utility functions. In phProc. 1st WINE, pages 92--101, 2005. Google ScholarDigital Library
- S. Khuller, A. Moss, J. Naor. The budgeted maximum coverage problem. phIPL, 70(1):39--45, 1999. Google ScholarDigital Library
- B. Lehmann, D. J. Lehmann, N. Nisan. Combinatorial auctions with decreasing marginal utilities. In phProc. 3rd EC, pages 18--28, 2001. Google ScholarDigital Library
- V. Mirrokni, M. Schapira, J. Vondrak. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. phThis proceedings. Google ScholarDigital Library
- G. L. Nemhauser, L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set function. In phMath. OR, 3(3):177--188, 1978.Google Scholar
- G. L. Nemhauser, L. A. Wolsey, M. L. Fisher. An analysis of approximations for maximizing submodular set functions. phMath. Prog., 14:265--294, 1978.Google ScholarDigital Library
- W. V. Zhang, X. H. Fei, B. Rey, R. Jones. Query rewriting using active learning for sponsored search. In Proc. 30th SIGIR, pages 853--854, 2007. Google ScholarDigital Library
- W. Zhang, R. Jones. Comparing click logs and editorial labels for training query rewriting. In Workshop on Query Log Analysis, 16th WWW, 2007.Google Scholar
Index Terms
- Optimizing query rewrites for keyword-based advertising
Recommendations
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
Query Folding
ICDE '96: Proceedings of the Twelfth International Conference on Data EngineeringQuery folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previous queries, or queries answerable by other databases. We investigate query ...
Determinacy and query rewriting for conjunctive queries and views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
Comments