PageRank and Similar Ideas - SNAP - Stanford University

More documents

Recommendations

Info

Each page starts with hub score 1 Authorities collect their votes (Note this is idealized example. In reality graph is not bipartite and each page has both the hub and authority score) 2/12/2012 Jure Leskovec, Stanford C246: Mining Massive Datasets 40
Hubs collect authority scores (Note this is idealized example. In reality graph is not bipartite and each page has both the hub and authority score) 2/12/2012 Jure Leskovec, Stanford C246: Mining Massive Datasets 41
Page 1 and 2: CS246: Mining Massive Datasets Jure
Page 3 and 4: Measures generic popularity of a pa
Page 5 and 6: Assume each walker has a small prob
Page 7 and 8: 0.5 0.4 1 0.2 0.5 0.4 2 3 0.8 1 1 1
Page 10 and 11: Spamming: any deliberate action to
Page 12 and 13: As people began to use search engin
Page 14 and 15: Believe what people say about you,
Page 16 and 17: Once Google became the dominant sea
Page 18 and 19: Spammer’s goal: Maximize the Pag
Page 20 and 21: x: PageRank contributed by accessib
Page 23 and 24: Combating term spam Analyze text u
Page 25 and 26: Call the subset of seed pages that
Page 27 and 28: Trust attenuation: The degree of t
Page 29 and 30: Suppose we want to pick a seed set
Page 31: (p) = PageRank of page p r + (p) =
Page 34 and 35: … IJCAI KDD ICDM SDM AAAI NIPS
Page 37 and 38: HITS (Hypertext‐Induced Topic Sel
Page 39: Interesting pages fall into two cla
Page 43 and 44: A good hub links to many good autho
Page 45 and 46: HITS converges to a single stable p
Page 47 and 48: The HITS algorithm: Initialize h,
Page 49 and 50: HITS algorithm in new notation: Se
Page 51 and 52: PageRank and HITS are two solutions
Page 53 and 54: Techniques for achieving high relev
Page 55: Analyze text using statistical meth

PageRank and Similar Ideas - SNAP - Stanford University

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?