Haveliwala (Link Analysis Link Analysis)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(nz)$? words (Stores and updates z O(n)-sized vectors designed to converge to some stationary distributions) == Description == PageRank with categories/topics == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2002 == Reference == http://www-cs-students.stanford.edu/~taherh/papers/topic-sensitive-pagerank.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m n )$

Space Complexity

$O(nz)$? words

(Stores and updates z O(n)-sized vectors designed to converge to some stationary distributions)

Description

PageRank with categories/topics

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2002

Reference

http://www-cs-students.stanford.edu/~taherh/papers/topic-sensitive-pagerank.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Haveliwala_(Link_Analysis_Link_Analysis)&oldid=44976"