PageRank课件.pptVIP

* * Update step 0 3 1, 5, 6 1 4 17, 64, 113, 117 2 2 13, 23 src degree destination 0 1 2 3 4 5 6 0 1 2 3 4 5 6 rnew rold Initialize all entries of rnew to (1-?)/N For each page p (out-degree n): Read into memory: p, n, dest1,…,destn, rold(p) for j = 1..n: rnew(destj) += ?*rold(p)/n Analysis In each iteration, we have to: Read rold and M Write rnew back to disk IO Cost = 2|r| + |M| What if we had enough memory to fit both rnew and rold? What if we could not even fit rnew in memory? 10 billion pages * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Link Analysis Algorithms Page Rank Slides from Stanford CS345, slightly modified. Link Analysis Algorithms Page Rank Hubs and Authorities Topic-Specific Page Rank Spam Detection Algorithms Other interesting topics we won’t cover Detecting duplicates and mirrors Mining for communities Ranking web pages Web pages are not equally “important” v Inlinks as votes has 23,400 inlinks has 1 inlink Are all inlinks equal? Recursive question! Simple recursive formulation Each link’s vote is proportional to the importance of its source page If page P with importance x has n outlinks, each link gets x/n votes Page P’s own importance is the sum of the votes on its inlinks Simple “flow” model The web in 1839 Yahoo M’soft Amazon y a m y/2 y/2 a/2 a/2 m y = y /2 + a /2 a = y /2 + m m = a /2 Solving the flow equations 3 equations, 3 unknowns, no constants No unique solution All solutions equivalent modulo scale factor Additional constraint forces uniqueness y+a+m = 1 y = 2/5, a = 2/5, m = 1/5 Gaussian elimination method works for small examples, but we need a better method for large graphs Matrix formulation Matrix M has one row and one column for each web page Suppose page j has n outlinks If j ? i, then Mij=1/n Else Mij=0 M is a column stochastic matrix Columns sum to 1 Suppose r is a vector with one entry per web page ri is the importance score of page i Call it the rank vector |r| = 1 Example Suppose page j l