Optimizing query rewrites for keyword-based advertising

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2008, Pages 10-19

  Malekian, Azarakhsh ^a   Chang, Chi Chao ^b   Kumar, Ravi ^b   Wang, Grant ^b  

^a University of Maryland ^*  (United States)

^b YAHOO INC   (United States)

Author keywords

Greedy algorithm; Keyword based advertising; Query rewriting; Submodularity

Indexed keywords

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; COVERING PROBLEMS; GRAPH COVERING; GREEDY ALGORITHMS; QUERY REWRITINGS; SUBMODULARITY; THREE-LAYER;

ELECTRIC CONDUCTIVITY MEASUREMENT; ELECTRONIC COMMERCE;

APPROXIMATION ALGORITHMS;

EID: 77950948821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1386790.1386793     Document Type: Conference Paper

References (21)

1. 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.
2. D. Beeferman, A. Berger. Agglomerative clustering of a search engine query log. In Proc. 6th KDD, pages 407-416, 2000.
3. J. Breese, D. Heckerman, C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. 14th UAI, pages 43-52, 1998.
4. S. Cucerzan, R. W. White. Query suggestion based on user landing pages. In Proc. 30th SIGIR, pages 875-876, 2007.
5. 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.
6. D. Fain, J. Pedersen. Sponsored search. In Bulletin of the American Society for Information Science and Technology, 2005.
7. U. Feige, V. Mirrokni, J. Vondrak. Maximizing non-monotone submodular functions. In Proc. 48th FOCS, pages 461-471, 2007.
8. L. K. Fleisher, M. X. Goemans, V. S. Mirrokni, M. Sviridenko. Tight approximation algorithms for maximum general assignment problems. In Proc. 17th SODA, pages 611-620, 2006.
9. P. Goundan, A. Schulz. Revisiting the greedy approach to submodular set function maximization. In Manuscript, 2007.
10. J. Herlocker, J. Konstan, A. Borchers, J. Riedl. An algorithmic framework for performing collaborative filtering. In Proc. 22nd SIGIR, pages 230-237, 1999.
11. D. S. Hochbaum, A. Pathria. Analysis of the greedy approach in covering problems. Unpublished, 1994.
12. G. Jeh, J. Widom. Simrank: A measure of structural-context similarity. In Proc. 8th KDD, pages 538-543, 2002.
13. R. Jones, B. Rey, O. Madani, W. Greiner. Generating query substitutions. In Proc. 15th WWW, pages 387-396, 2006.
14. S. Khot, R. Lipton, E. Markakis, A. Mehta. Inapproximability results for combinatorial auctions with submodular utility functions. In Proc. 1st WINE, pages 92-101, 2005.
15. S. Khuller, A. Moss, J. Naor. The budgeted maximum coverage problem. IPL, 70(1):39-45, 1999.
16. B. Lehmann, D. J. Lehmann, N. Nisan. Combinatorial auctions with decreasing marginal utilities. In Proc. 3rd EC, pages 18-28, 2001.
17. V. Mirrokni, M. Schapira, J. Vondrak. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. This proceedings.
18. G. L. Nemhauser, L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set function. In Math. OR, 3(3):177-188, 1978.
19. G. L. Nemhauser, L. A. Wolsey, M. L. Fisher. An analysis of approximations for maximizing submodular set functions. Math. Prog., 14:265-294, 1978.
20. 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.
21. W. Zhang, R. Jones. Comparing click logs and editorial labels for training query rewriting. In Workshop on Query Log Analysis, 16th WWW, 2007.