stanford大学-大数据挖掘-PageRank-13.pptVIP

  • 25
  • 0
  • 约9.08千字
  • 约 37页
  • 2017-05-21 发布于四川
  • 举报
CS345 Data Mining Link Analysis Algorithms Page Rank 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 import

文档评论(0)

1亿VIP精品文档

相关文档