DS504/CS586: Big Data Analytics Graph Mining Prof. Yanhua Li

Transcription

1 Welcome to DS504/CS586: Big Data Analytics Graph Mining Prof. Yanhua Li Time: 6:00pm 8:50pm R Location: AK232 Fall 2016

2 Graph Data: Social Networks Facebook social graph 4-degrees of separation [Backstrom-Boldi-Rosa-Ugander-Vigna, 2011] J. Leskovec, A. Rajaraman, J. Ullman: 2 Mining of Massive Datasets,

3 Graph Data: Media Networks Connections between political blogs Polarization of the network [Adamic-Glance, 2005] J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, 3

4 Graph Data: Information Nets Citation networks and Maps of science [Börner et al., 2012] J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, 4

5 Graph Data: Communication Nets domain2 domain1 router domain3 Internet J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, 5

6 Graph Data: Topological Networks Seven Bridges of Königsberg [Euler, 1735] Return to the starting point by traveling each link of the graph once and only once. J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, 6

7 Graph representation of networks Friendship Resistance Co-authorship Following One-way road Wireless channel Undirected links Directed links Friend & foe Trust & distrust Multi-relational links Hyperlinks Repulsion & cohesion Signed links

8 Mining in Big Graphs v Network Statistic Analysis (this lecture) Network Size Degree distribution. v Node Ranking (Next lecture) Identifying most influential nodes Viral Marketing, resource allocation

9 Graph Data: Social Networks Facebook social graph 4-degrees of separation [Backstrom-Boldi-Rosa-Ugander-Vigna, 2011] J. Leskovec, A. Rajaraman, J. Ullman: 9 Mining of Massive Datasets,

10 Sampling graphs Random sampling (uniform & independent) crawling } vertex sampling } BFS sampling } edge sampling } random walk sampling 10 10

11 Random Walks on Graphs Random walk sampling Random Walk Routing Molecule in liquid Influence diffusion

12 Undirected Graphs Undirected!!

13 Random Walk v Adjacency matrix! # A = # # # " $ & & & & %! # D = # # # " v Transition Probability Matrix P ij = 1 k i v E : number of links v Stationary Distribution $ & & & & % Symmetric 1 " $ P = A D 1 = $ $ $ # Undirected 0 1/ 3 1/ 3 1/ 3 1/ 2 0 1/ 2 0 1/ 3 1/ 3 0 1/ 3 1/ 2 0 1/ 2 0 % ' ' ' ' & π i = d i 2 E

14 Metropolis-Hastings Random Walk v Adjacency matrix! # A = # # # " $ & & & & %! # D = # # # " v Transition Probability Matrix 1 k min(1, υ ) if w neighbor of υ MH k k P υ w υ, w = MH 1 Pυ, y if w= υ y υ v E : number of links v Stationary Distribution π υ = 1 V $ & & & & % Symmetric 1 " $ P = A D 1 = $ $ $ # Undirected 0 1/ 3 1/ 3 1/ 3 1/ 3 1/ 3 1/ 3 0 1/ 3 1/ 3 0 1/ 3 1/ 3 0 1/ 3 1/ 3 % ' ' ' ' &

15 Walking in Facebook: A Case Study of Unbiased Sampling of OSNs Minas Gjoka, Maciej Kurant, Carter Butts, Athina Markopoulou UC Irvine, EPFL Walking in Facebook 15

16 Outline v Motivation and Problem Statement v Sampling Methodology v Data Analysis v Conclusion Walking in Facebook 16

17 Online Social Networks (OSNs) v A network of declared friendships between users v Allows users to maintain relationships G F E H C D B v Many popular OSNs with different focus Facebook, LinkedIn, Flickr, A Social Graph Walking in Facebook 17

18 Why Sample OSNs? v Representative samples desirable study properties test algorithms v Obtaining complete dataset difficult companies usually unwilling to share data tremendous overhead to measure all (~100TB for Facebook) Walking in Facebook 18

19 Problem statement v Obtain a representative sample of users in a given OSN by exploration of the social graph. in this work we sample Facebook (FB) explore graph using various crawling techniques Walking in Facebook 19

20 Related Work v Graph traversal (BFS) A. Mislove et al, IMC 2007 Y. Ahn et al, WWW 2007 C. Wilson, Eurosys 2009 v Random walks (MHRW, RDS) M. Henzinger et al, WWW 2000 D. Stutbach et al, IMC 2006 A. Rasti et al, Mini Infocom 2009 Walking in Facebook 20

21 Outline v Motivation and Problem Statement v Sampling Methodology crawling methods data collection convergence evaluation method comparisons v Data Analysis v Conclusion Walking in Facebook 21

22 (1) Breadth-First-Search (BFS) v Starting from a seed, explores all neighbor nodes. Process continues iteratively without replacement. G F E H C v BFS leads to bias towards high degree nodes Lee et al, Statistical properties of Sampled Networks, Phys Review E, 2006 D A B Unexplored v Early measurement studies of OSNs use BFS as primary sampling technique i.e [Mislove et al], [Ahn et al], [Wilson et al.] Explored Visited Walking in Facebook 22

23 (2) Random Walk (RW) Explores graph one node at a time with replacement P Degree of node υ RW υ, w In the stationary distribution π υ = Number of edges = 1 k k 2 υ υ E H G D 1/3 F E C 1/3 A 1/3 Next candidate Current node B Walking in Facebook 23

24 (3) Re-Weighted Random Walk (RWRW) Hansen-Hurwitz estimator v Corrects for degree bias at the end of collection v Without re-weighting, the probability distribution for node property A is: pa ( ) i u A1 A i i = = 1 V u V v Re-Weighted probability distribution : Subset of sampled nodes with value i All sampled nodes pa ( ) i u A = u V i 1/ 1/ k k u u Degree of node u Walking in Facebook 24

25 (4) Metropolis-Hastings Random Walk (MHRW) v Explore graph one node at a time with replacement H G C F E 1 k min(1, υ ) if w neighbor of υ MH k k P υ w υ, w = MH 1 Pυ, y if w= υ y υ v In the stationary distribution π υ = 1 V MH P AA D 1/3 1/5 A 2/15 1/3 Walking in Facebook 25 B Next candidate Current node = 1 ( + + ) = MH 1 3 P AC = =

26 Uniform userid Sampling (UNI) v As a basis for comparison, we collect a uniform sample of Facebook userids (UNI) rejection sampling on the 32-bit userid space v UNI not a general solution for sampling OSNs userid space must not be sparse names instead of numbers Walking in Facebook 26

27 Summary of Datasets Sampling method MHRW RW BFS UNI #Valid Users 28x81K 28x81K 28x81K 984K # Unique Users 957K 2.19M 2.20M 984K Egonets for a subsample of MHRW - local properties of nodes Datasets available at: Walking in Facebook 27

28 Data Collection Basic Node Information v What information do we collect for each sampled node u? UserID Name Networks Privacy settings Friend List UserID Name Networks Privacy Settings u UserID Name Networks Privacy settings 1111 UserID Name Networks Privacy settings Regional School/Workplace Send Message View Friends Profile Photo Add as Friend Walking in Facebook 28

29 Detecting Convergence Number of samples (iterations) to loose dependence from starting points? Walking in Facebook 29

30 Online Convergence Diagnostics Geweke v Detects convergence for a single walk. Let X be a sequence of samples for metric of interest. Xa Xb EX ( a) EX ( b) z = Var( X ) Var( X ) a b J. Geweke, Evaluating the accuracy of sampling based approaches to calculate posterior moments in Bayesian Statistics 4, 1992 Walking in Facebook 30

31 Online Convergence Diagnostics Gelman-Rubin v Detects convergence for m>1 walks Walk 1 Between walks variance Walk 2 Walk 3 R n 1 m+ 1 B = + n mn W Within walks variance A. Gelman, D. Rubin, Inference from iterative simulation using multiple sequences in Statistical Science Volume 7, 1992 Walking in Facebook 31

32 When do we reach equilibrium? Node Degree Burn-in determined to be 3K Walking in Facebook 32

33 Methods Comparison Node Degree v Poor performance for BFS, RW 28 crawls v MHRW, RWRW produce good estimates per chain overall Walking in Facebook 33

34 Sampling Bias BFS v Low degree nodes underrepresented by two orders of magnitude v BFS is biased Walking in Facebook 34

35 Sampling Bias MHRW, RW, RWRW v v Degree distribution identical to UNI (MHRW,RWRW) RW as biased as BFS but with smaller variance in each walk Walking in Facebook 35

36 Practical Recommendations for Sampling Methods v Use MHRW or RWRW. Do not use BFS, RW. v Use formal convergence diagnostics assess convergence online use multiple parallel walks v MHRW vs RWRW RWRW slightly better performance MHRW provides a ready-to-use sample Walking in Facebook 36

37 Outline v Motivation and Problem Statement v Sampling Methodology v Data Analysis v Conclusion Walking in Facebook 37

38 FB Social Graph Degree Distribution, Power Law Distribution f(k)=b*k -a a 1 =1.32 a 2 =3.38 v Degree distribution not a power law Walking in Facebook 38

39 Any Comments & Critiques?

40 Next Class: Graph Mining (II) v Do assigned readings before class v Submit reviews/critiques v Attend in-class discussions 40