Jeh and Widom (Link Analysis Link Analysis)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(nh)$ words (Stores and updates z O(n)-sized vectors designed to converge to some basis vectors) == Description == Personalized PageRank with hubs == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == http://infolab.stanford.edu/~glenj/spws.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m n )$

Space Complexity

$O(nh)$ words

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

Description

Personalized PageRank with hubs

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2003

Reference

http://infolab.stanford.edu/~glenj/spws.pdf

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