Finding dense and isolated submarkets in a sponsored search spending graph
Source:
CIKM, ACM, Lisbon, Portugal, p.613-622 (2007)
ISBN:
978-1-59593-803-9
Abstract:
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.
Download:
ACM COPYRIGHT NOTICE. Copyright © 2008 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or
permissions@acm.org.
