k - SNAP - Stanford University

More documents

Recommendations

Info

1 2 3 4 a b c d (1,a) (2,b) 3/7/2011 Jure Leskovec, <strong>Stanford</strong> C246: Mining Massive Datasets 12
Banner ads (1995-2001) Initial form of web advertising Popular websites charged X$ for every 1000 “impressions” of ad Called “CPM” rate Modeled similar to TV, magazine ads Untargeted to demographically targeted Low clickthrough rates low ROI for advertisers 3/7/2011 Jure Leskovec, <strong>Stanford</strong> C246: Mining Massive Datasets 13
Page 1 and 2: CS246: Mining Massive Datasets Jure
Page 3 and 4: 1 2 3 Girls 4 d Boys 3/7/2011 Jure
Page 5 and 6: 1 2 3 Girls 4 d Boys M = {(1,c),(2,
Page 7 and 8: Initially, we are given the set Boy
Page 9 and 10: Greedy algorithm for online graph m
Page 11: Consider the set G of girls matched
Page 15 and 16: 3/7/2011 Jure Leskovec, Stanford C2
Page 17 and 18: A stream of queries arrives at the
Page 19 and 20: Advertiser Bid CTR Bid * CTR A B C
Page 21 and 22: The environment: There is one ad s
Page 23 and 24: BALANCE by Mehta, Saberi, Vazirani,
Page 25 and 26: Consider simple case: Two advertis
Page 27 and 28: In the general case, worst competit
Page 29 and 30: … A 1 A 2 A 3 A N-1 A N B/(N-2) B
Page 31 and 32: Fact: H n = ∑ i=1..n1/i = approx.
Page 33 and 34: Arbitrary bids, budgets Consider q

k - SNAP - Stanford University

Create successful ePaper yourself

Delete template?

Save as template?