Randomized HITS (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 nlogn )$ == Space Complexity == $O(n)$ words (Stores and updates hub and authority values per node) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2001 == Reference == https://dl.acm.org/doi/pdf/10.1145/383952.384003")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m nlogn )$

Space Complexity

$O(n)$ words

(Stores and updates hub and authority values per node)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2001

Reference

https://dl.acm.org/doi/pdf/10.1145/383952.384003

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