Finding dense and isolated submarkets in a sponsored search spending graph

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.

[1]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[2]  M. Desu.  A Selection Problem , 1970 .

[3]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[4]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[5]  J. Picard,et al.  Selected Applications of Minimum Cuts in Networks , 1982 .

[6]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[7]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[8]  Guy Kortsarz,et al.  Generating Sparse 2-Spanners , 1994, J. Algorithms.

[9]  Sachin B. Patkar,et al.  Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach , 1994, MFCS.

[10]  U. Feige,et al.  On the densest k-subgraph problems , 1997 .

[11]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

[12]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[13]  U. Feige,et al.  On the Densest K-subgraph Problem , 1997 .

[14]  Dorit S. Hochbaum,et al.  The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem , 1998, IPCO.

[15]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[16]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[17]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Santosh S. Vempala,et al.  On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[19]  Moses Charikar,et al.  Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.

[20]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[21]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.

[22]  Leonid Zhukov,et al.  Clustering of bipartite advertiser-keyword graph , 2003 .

[23]  Joseph T. Chang,et al.  Spectral biclustering of microarray data: coclustering genes and conditions. , 2003, Genome research.

[24]  Sachin B. Patkar,et al.  Improving graph partitions using submodular functions , 2003, Discret. Appl. Math..

[25]  Satish Rao,et al.  A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts , 2004, IPCO.

[26]  Bin Zhang,et al.  A Simultaneous Maximum Flow Algorithm for the Selection Model , 2005 .

[27]  Inderjit S. Dhillon,et al.  A fast kernel-based multilevel algorithm for graph clustering , 2005, KDD '05.

[28]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[29]  Robert Krauthgamer,et al.  A Polylogarithmic Approximation of the Minimum Bisection , 2006, SIAM Rev..

[30]  John Tomlin,et al.  Optimal delivery of sponsored search advertisements subject to budget constraints , 2007, EC '07.

[31]  Andrew V. Goldberg,et al.  Experimental Evaluation of Parametric Max-Flow Algorithms , 2007, WEA.

[32]  Sanjeev Arora,et al.  Expander flows, geometric embeddings and graph partitioning , 2009, JACM.