1. Jure Leskovec Machine Learning Department Carnegie Mellon University

2.  Today: Large on-line systems have detailed records of human activity  On-line communities: ▪ Facebook (64 million users, billion dollar business) ▪ MySpace (300 million users)  Communication: ▪ Instant Messenger (~1 billion users)  News and Social media: ▪ Blogging (250 million blogs world-wide, presidential candidates run blogs)  On-line worlds: ▪ World of Warcraft (internal economy 1 billion USD) ▪ Second Life (GDP of 700 million USD in ‘07) Opportunities for impact in science and industry 2

3. b) Internet (AS) c) Social networks a) World wide web d) Communicatione) Citationsf) Protein interactions 3

4.  We know lots about the network structure:  Properties: Scale free [Barabasi ’99], 6-degrees of separation [Milgram ’67], Navigation [Adamic-Adar ’03, LibenNowell ’05], Bipartite cores [Kumar et al. ’99], Network motifs [Milo et al. ‘02], Communities [Newman ‘99], Conductance [Mihail-Papadimitriou-Saberi ‘06], Hubs and authorities [Page et al. ’98, Kleinberg ‘99]  Models: Preferential attachment [Barabasi ’99], Small- world [Watts-Strogatz ‘98], Copying model [Kleinberg el al. ’99], Heuristically optimized tradeoffs [Fabrikant et al. ‘02], Congestion [Mihail et al. ‘03], Searchability [Kleinberg ‘00], Bowtie [Broder et al. ‘00], Transit-stub [Zegura ‘97], Jellyfish [Tauro et al. ‘01] We know much less about processes and dynamics of networks 4

5.  Network Dynamics:  Network evolution ▪ How network structure changes as the network grows and evolves?  Diffusion and cascading behavior ▪ How do rumors and diseases spread over networks? 5

6.  We need massive network data for the patterns to emerge:  MSN Messenger network [WWW ’08, Nature ‘08] (the largest social network ever analyzed) ▪ 240M people, 255B messages, 4.5 TB data  Product recommendations [EC ‘06] ▪ 4M people, 16M recommendations  Blogosphere [work in progress] ▪ 60M posts, 120M links 6

7. Diffusion & Cascades Network Evolution Patterns & Observations Q1: What do cascades look like? Trees? Stars? Chains? Q4: How does network structure change as the network grows/evolves? Models & Algorithms Q2: How do we find influential nodes? Q3: How do we quickly detect epidemics? Q5: How do we generate realistic looking and evolving networks? 7

8. Diffusion & Cascades Network Evolution Patterns & Observations Q1: What do cascades look like? Trees? Stars? Chains? Q4: How does network structure change as the network grows/evolves? Models & Algorithms Q2: How do we find influential nodes? Q3: How do we quickly detect epidemics? Q5: How do we generate realistic looking and evolving networks? 8

9.  Behavior that cascades from node to node like an epidemic  News, opinions, rumors  Word-of-mouth in marketing  Infectious diseases  As activations spread through the network they leave a trace – a cascade Cascade (propagation graph) Network 9

10.  People send and receive product recommendations, purchase products  Data: Large online retailer: 4 million people, 16 million recommendations, 500k products 10% credit10% off 10 [w/ Adamic-Huberman, EC ’06]

11.  Bloggers write posts and refer (link) to other posts and the information propagates  Data: 10.5 million posts, 16 million links 11 [w/ Glance-Hurst et al., SDM ’07]

12.  Viral marketing cascades are more social:  Collisions (no summarizers)  Richer non-tree structures  Are they stars? Chains? Trees?  Information cascades (blogosphere):  Viral marketing (DVD recommendations): (ordered by frequency) 12 propagation [w/ Kleinberg-Singh, PAKDD ’06]

13. Diffusion & Cascades Network Evolution Patterns & Observations A1: Cascade shapes. Viral marketing cascades more social. Q4: How does network structure change as the network grows/evolves? Models & Algorithms Q2: How do we find influential nodes? Q3: How do we quickly detect epidemics? Q5:How do we generate realistic looking and evolving networks? 13

14.  Blogs – information epidemics  Which are the influential/infectious blogs?  Viral marketing  Who are the trendsetters?  Influential people?  Disease spreading  Where to place monitoring stations to detect epidemics? 14

15. How to quickly detect epidemics as they spread? 15 c1c1 c2c2 c3c3 [w/ Krause-Guestrin et al., KDD ’07] (best student paper)

16.  Cost:  Cost of monitoring is node dependent  Reward:  Minimize the number of affected nodes: ▪ If A are the monitored nodes, let R(A) denote the number of nodes we save We also consider other rewards: ▪ Minimize time to detection ▪ Maximize number of detected outbreaks R(A) A 16 ( ) [w/ Krause-Guestrin et al., KDD ’07] (best student paper)

17. Reward for detecting cascade i  Given:  Graph G(V,E), budget M  Data on how cascades C 1, …, C i, …,C K spread over time  Select a set of nodes A maximizing the reward subject to cost(A) ≤ M  Solving the problem exactly is NP-hard  Max-cover [Khuller et al. ’99] 17

18.  Problem structure: Submodularity of the reward functions  CELF: algorithm with approximate guarantee  Speed up: Lazy evaluation to speed-up CELF We extend the result of [Kempe-Kleinberg-Tardos ’03] 18 [w/ Krause-Guestrin et al., KDD ’07] (best student paper)

19.  Theorem: Reward function R is submodular (diminishing returns, think of it as “convexity”) 19 (best student paper) [w/ Krause-Guestrin et al., KDD ’07] Gain of adding a node to a small setGain of adding a node to a large set R(A  {u}) – R(A) ≥ R(B  {u}) – R(B) A  B S1S1 S2S2 Placement A={S 1, S 2 } S’ New monitored node: Adding S’ helps a lot S2S2 S4S4 S1S1 S3S3 Placement B={S 1, S 2, S 3, S 4 } S’ Adding S’ helps very little

20.  We develop CELF (cost-effective lazy forward-selection) algorithm:  Two independent runs of a modified greedy ▪ Solution set A’: ignore cost, greedily optimize reward ▪ Solution set A’’: greedily optimize reward/cost ratio  Pick best of the two: arg max(R(A’), R(A’’))  Theorem: If R is submodular then CELF is near optimal  CELF achieves ½(1-1/e) factor approximation For the size of our problems naïve CELF is too slow 20 (best student paper) [w/ Krause-Guestrin et al., KDD ’07]

21.  Observation: Submodularity guarantees that marginal rewards decrease with the solution size  Idea:  Use marginal reward from previous step as a upper bound on current marginal reward d Marginal reward a b c d e 21

22.  CELF algorithm:  Keep an ordered list of marginal rewards r i from previous step  Re-evaluate r i only for the top node a b c a b c d d e e Marginal reward 22

23.  CELF algorithm:  Keep an ordered list of marginal rewards r i from previous step  Re-evaluate r i only for the top node a a b c d dbce e Marginal reward 23

24.  CELF algorithm:  Keep an ordered list of marginal rewards r i from previous step  Re-evaluate r i only for the top node a c a b c d d b Marginal reward e e 24

25. For more info see our website: www.blogcascade.org  Which blogs should one read to catch big stories? CELF In-links Random # posts Out-links Number of selected blogs (sensors) Reward (higher is better) 25 (used by Technorati)

26. CELF Greedy Exhaustive search CELF runs 700x faster than simple greedy algorithm Number of selected blogs (sensors) Run time (seconds) (lower is better) 26

27.  Given:  a real city water distribution network  data on how contaminants spread over time  Place sensors (to save lives)  Problem posed by the US Environmental Protection Agency SS 27 c1c1 c2c2 [w/ Krause et al., J. of Water Resource Planning]

28.  Our approach performed best at the Battle of Water Sensor Networks competition CELF Population Random Flow Degree AuthorScore CMU (CELF) 26 Sandia21 U Exter20 Bentley systems19 Technion (1)14 Bordeaux12 U Cyprus11 U Guelph7 U Michigan4 Michigan Tech U3 Malcolm2 Proteo2 Technion (2)1 Number of placed sensors Population saved (higher is better) 28 [w/ Ostfeld et al., J. of Water Resource Planning]

29. Diffusion & Cascades Network Evolution Patterns & Observations A1: Cascade shapes. Viral marketing cascades more social. Q4: How does network structure change as the network grows/evolves? Models & Algorithms A2, A3: CELF algorithm for detecting cascades and outbreaks Q5: How do we generate realistic looking and evolving networks? 29

30.  Empirical findings on real graphs led to new network models  Such models make assumptions/predictions about other network properties  What about network evolution? 30 log degree log prob. Model Power-law degree distributionPreferential attachment Explains

31.  Networks are denser over time  Densification Power Law: a … densification exponent (1 ≤ a ≤ 2)  What is the relation between the number of nodes and the edges over time?  Prior work assumes: constant average degree over time Internet Citations a=1.2 a=1.6 N(t) E(t) N(t) E(t) 31 [w/ Kleinberg-Faloutsos, KDD ’05] (best research paper)

32.  Prior models and intuition say that the network diameter slowly grows (like log N, log log N) time diameter size of the graph Internet Citations  Diameter shrinks over time  as the network grows the distances between the nodes slowly decrease 32 [w/ Kleinberg-Faloutsos, KDD ’05] (best research paper)

33.  Want to generate realistic networks:  Why synthetic graphs?  Anomaly detection, Simulations, Predictions, Null-model, Sharing privacy sensitive graphs, …  Q: What is a good model that we can fit to the data?  A: Next slide.  Q: Which network properties do we care about?  A: Don’t commit, let’s match adjacency matrices 33 Compare graphs properties, e.g., degree distribution Given a real network Generate a synthetic network

34.  We prove Kronecker graphs mimic real graphs:  Power-law degree distribution, Densification, Shrinking/stabilizing diameter, Spectral properties Initiator (9x9) (3x3) (27x27) Kronecker product of graph adjacency matrices 34 [w/ Chakrabarti-Kleinberg-Faloutsos, PKDD ’05] p ij Edge probability

35.  Maximum likelihood estimation  Naïve estimation takes O(N!N 2 ):  N! for different node labelings: ▪ Our solution: Metropolis sampling: N!  (big) const  N 2 for traversing graph adjacency matrix ▪ Our solution: Kronecker product (E << N 2 ): N 2  E  Do stochastic gradient descent ab cd P(|) Kronecker arg max We estimate the model in O(E) 35 [w/ Faloutsos, ICML ’07]

36.  We search the space of ~10 1,000,000 permutations  Fitting takes 2 hours  Real and Kronecker are very close 36 Degree distribution node degree probability 0.990.54 0.490.13 Path lengths number of hops # reachable pairs “Network” values rank network value [w/ Faloutsos, ICML ’07]

37. Diffusion & Cascades Network Evolution Patterns & Observations A1: Cascade shapes. Viral marketing cascades more social. A4: Densification, Shrinking diameters Models & Algorithms algorithm for detecting cascades and outbreaks A5: Kronecker graphs, Estimating Kronecker initiator Other topics Conclusion and Future work A2, A3: CELF 37

38.  P1) Query Projections:  Predicting search result quality without page content  P2) MSN Instant Messenger:  Social network of the whole world 38

39.  User types in a query to a search engine  Search engine returns results: Is this a good set of search results? Result returned by the search engine Hyperlinks Non-search results connecting the graph 39 [w/ Dumais-Horvitz, WWW ’07]

40. Q QueryResults Projection on the web graph Query projection graph Generate graphical features Query connection graph -- -- ---- --- --- ---- ------ --- ----- --- -- ------ ----- Construct case library Predictions

41.  The idea  Find features that describe the structure of the graph  Then use the features for machine learning  Want features that describe  Connectivity of the graph  Centrality of projection and connector nodes  Clustering and density of the core of the graph vs.

42.  Dataset:  Graph: 40 million nodes, 720 million edges  30,000 queries with top 20 results for each ▪ Human assigned relevance. 6-point scale: Perfect to Bad  Task:  Predict the highest rating in the set of results ▪ 2-class problem: “Good” (top 3 ratings) vs. “Poor” (bottom 3)  Result:  Predict search result quality with 80% accuracy just from the connection patterns between the results

43. 43 Predict “Good” Predict “Poor” Good? Poor? [w/ Dumais-Horvitz, WWW ’07]

44. Good result sets have:  Search result nodes are hub nodes in the graph  Small connector node degrees  Big connected component  Few isolated nodes in projection graph  Few connector nodes AttributesAccuracy Marginals0.55 RankNet0.63 Query projection0.82

45. Milgram’s small world experiment (i.e., hops + 1) 45 Lots of engineering effort and good hardware:  4 dual-core Opteron server  48GB memory  6.8TB of fast SCSI disks How to learn short paths?  Small-world experiment [Milgram ‘67]  People send letters from Nebraska to Boston  How many steps does it take?  Messenger social network – largest network analyzed  240M people, 30B conversations, 4.5TB data [w/ Horvitz, WWW ’08, Nature ‘08] MSN Messenger network Number of steps between pairs of people

46. Diffusion & Cascades Network Evolution Patterns & Observations A1: Cascade shapes. Viral marketing cascades more social. A4: Densification, Shrinking diameters Models & Algorithms A2, A3: CELF algorithm for detecting cascades and outbreaks A5: Kronecker graphs, Estimating Kronecker initiator Big data matters 46

47.  How do news and information spread  New ranking and influence measures for blogs  Sentiment analysis from cascade structure  Crawling 2 million blogs/day (with Spinn3r) Obscure technology story Small tech blog Wired Slashdot New Scientist New York Times CNN BBC 47

48.  Models of information diffusion  When, where and what post will create a cascade?  Where should one tap the network to get the effect they want?  Social Media Marketing  How to handle richer classes of graphs  Interaction of network structure and node/edge attributes 48

49.  Why are networks the way they are?  Continue work on fundamental properties of networks  Build models and understanding  Network community structure  Health of a social network  Steer the network evolution  Adoption of social networking services (with Facebook)  Predictive modeling of large communities  Online multi-player games are closed worlds with detailed traces of human activity  Predict success of guilds, battles, elections (with EVE online) 49

50.  Map-reduce for massive graphs  Algorithms and techniques for massive graphs  With Yahoo! Research: 4000 node Hadoop cluster ▪ world’s 50 th fastest supercomputer ▪ 3 TB memory ▪ 1.5 PB storage  We already have new ways to peek into the structure of massive networks 50

51. Computer systems Theory and algorithms Machine learning / Data mining 51 (complex) networks

52. Computer systems Theory and algorithms Machine learning / Data mining 52 Social Sciences Biology Physics Applications & Industry Statistics (complex) networks

53. Christos Faloutsos Jon Kleinberg Andreas Krause Carlos Guestrin Eric Horvitz Susan Dumais Andrew Tomkins Ravi Kumar Lada Adamic Bernardo Huberman Kevin Lang Michael Manohey Zoubin Gharamani Anirban Dasgupta Tom Mitchell John Lafferty Larry Wasserman Avrim Blum Samuel Madden Michalis Faloutsos Ajit Singh John Shawe-Taylor Lars Backstrom Marko Grobelnik Natasa Milic-Frayling Dunja Mladenic Jeff Hammerbacher Matt Hurst Deepay Chakrabarti Natalie Glance Jeanne VanBriesen Microsoft Research Yahoo Research Facebook Eve online Spinn3r LinkedIn Nielsen BuzzMetrics Microsoft Live Labs Google 53

54. Diffusion & Cascades Network Evolution Patterns & Observations A1: Cascade shapes. Viral marketing cascades more social. A4: Densification, Shrinking diameters Models & Algorithms A2, A3: CELF algorithm for detecting cascades and outbreaks A5: Kronecker graphs, Estimating Kronecker initiator Big data matters 54