Slide 1

Purnamrita Sarkar (Carnegie Mellon) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.) Slide 2 Which pair of nodes {i,j} should be connected? Variant: node i is given Friend suggestion in Facebook Alice Bob Charlie Movie recommendation in Netflix Slide 3 Predict link between nodes With the minimum number of hops With max common neighbors (length 2 paths) 8 followers 1000 followers Prolific common friends Less evidence Less prolific Much more evidence Alice Bob Charlie The Adamic/Adar score gives more weight to low degree common neighbors. Slide 4 Predict link between nodes With the minimum number of hops With more common neighbors (length 2 paths) With larger Adamic/Adar With more short paths (e.g. length 3 paths ) Slide 5 RandomShortest Path Common Neighbors Adamic/AdarEnsemble of short paths Link prediction accuracy* *Liben-Nowell & Kleinberg, 2003; Brand, 2005; Sarkar & Moore, 2007 How do we justify these observations? Especially if the graph is sparse Slide 6 6 Nodes are uniformly distributed in a latent space The problem of link prediction is to find the nearest neighbor who is not currently linked to the node. Equivalent to inferring distances in the latent space Raftery et al.s Model: Unit volume universe Points close in this space are more likely to be connected. Slide 7 7 1 Higher probability of linking Two sources of randomness Point positions: uniform in D dimensional space Linkage probability: logistic with parameters , r , r and D are known radius r determines the steepness Slide 8 RandomShortest Path Common Neighbors Adamic/AdarEnsemble of short paths Link prediction accuracy *Liben-Nowell & Kleinberg, 2003; Brand, 2005; Sarkar & Moore, 2007 Especially if the graph is sparse Slide 9 Pr 2 (i,j) = Pr(common neighbor|d ij ) Product of two logistic probabilities, integrated over a volume determined by d ij As Logistic Step function Much easier to analyze! i j Slide 10 10 Everyone has same radius r i j Empirical Bernstein Bounds on distance V(r)=volume of radius r in D dims =Number of common neighbors Unit volume universe Slide 11 OPT = node closest to i MAX = node with max common neighbors with i Theorem: d OPT d MAX d OPT + 2[ /V(1)] 1/D = c 1 (var N /N) + c 2 /(N -1 ) D=dimensionality w.h.p Common neighbors is an asymptotically optimal heuristic as N Slide 12 Node k has radius r k. i k if d ik r k (Directed graph) r k captures popularity of node k 12 i k j Type 1: i k j riri rjrj A(r i, r j,d ij ) Type 2: i k j i k j rkrk rkrk A(r k, r k,d ij ) Slide 13 i j k 1 ~ Bin[N 1, A(r 1, r 1, d ij )] 2 ~ Bin[N 2, A(r 2, r 2, d ij )] Example graph: N 1 nodes of radius r 1 and N 2 nodes of radius r 2 r 1 Bound d ij as a function of l using McDiarmids inequality. For l l we need l >> l to obtain similar bounds Also, we can obtain much tighter bounds for long paths if shorter paths are known to exist. Slide 19 1 Factor weak bound for Logistic Can be made tighter, as logistic approaches the step function. Slide 20 Three key ingredients 1. Closer points are likelier to be linked. Small World Model- Watts, Strogatz, 1998, Kleinberg 2001 2. Triangle inequality holds necessary to extend to l hop paths 3. Points are spread uniformly at random Otherwise properties will depend on location as well as distance Slide 21 RandomShortest Path Common Neighbors Adamic/AdarEnsemble of short paths Link prediction accuracy* *Liben-Nowell & Kleinberg, 2003; Brand, 2005; Sarkar & Moore, 2007 The number of paths matters, not the length For large dense graphs, common neighbors are enough Differentiating between different degrees is important In sparse graphs, length 3 or more paths help in prediction. Slide 22 Slide 23 23 Generative model Link Prediction Heuristics node a Most likely neighbor of node i ? node b Compare A few properties Can justify the empirical observations We also offer some new prediction algorithms Slide 24 Combine bounds from different radii But there might not be enough data to obtain individual bounds from each radius New sweep estimator Q r = Fraction of nodes w. radius r, which are common neighbors. Higher Q r smaller d ij w.h.p Slide 25 Q r = Fraction of nodes w. radius r, which are common neighbors larger Q r smaller d ij w.h.p T R : = Fraction of nodes w. radius R, which are common neighbors. Smaller T R large d ij w.h.p Slide 26 Q r = Fraction of nodes with radius r which are common neighbors T R = Fraction of nodes with radius R which are common neighbors Number of common neighbors of a given radius Large Q r small d ij Small T R large d ij r