Methods for improving sponsored search revenue are often tested or deployed within a small submarket of the larger marketplace. For many applications, the ideal submarket contains a small number of nodes, a large amount of spending within the submarket, and a small amount of spending leaving the submarket. We introduce an efficient algorithm for finding submarkets that are optimal for a user-specified tradeoff between these three quantities. We apply our algorithm to find submarkets that are both dense and isolated in a large spending graph from Yahoo! sponsored search. Copyright 2007 ACM.
CITATION STYLE
Lang, K. J., & Andersen, R. (2007). Finding dense and isolated submarkets in a sponsored search spending graph. In International Conference on Information and Knowledge Management, Proceedings (pp. 613–622). https://doi.org/10.1145/1321440.1321526
Mendeley helps you to discover research relevant for your work.