1 / 11

Topic-Sensitive PageRank

Topic-Sensitive PageRank. Taher H. Haveliwala Stanford University Presentation by Na Dai. The frame of system using topic-sensitive PageRank. PageRank. Rank is a n-dimension column vector of PageRank values.(i.e. Rank = (Rank(1), Rank(2),…, Rank(n)) T Motivation: irreducible & aperiodic

quito
Télécharger la présentation

Topic-Sensitive PageRank

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Topic-Sensitive PageRank Taher H. Haveliwala Stanford University Presentation by Na Dai

  2. The frame of system using topic-sensitive PageRank

  3. PageRank • Rank is a n-dimension column vector of PageRank values.(i.e. Rank = (Rank(1), Rank(2),…, Rank(n))T • Motivation: irreducible & aperiodic • Dangling node (Matrix D) • Damp factor α(Matrix E)

  4. Topic-Sensitive PageRank (1) • w (w1, w2,…,w16): a normalized vector with length 1 • wi = Pr(ci|q)

  5. Topic-Sensitive PageRank (2)

  6. Effect of ODP-Biasing (1)

  7. Effect of ODP-Biasing (2)

  8. Effect of ODP-Biasing (3)

  9. Query-sensitive Scoring

  10. Query-sensitive Scoring

  11. Future Work • Investigate the best basis topics • Topic granularity • Topics that are deeper in hierarchy • vj: resistant to adversarial ODP editors

More Related