The (Hyperlink-Induced Topic Search) HITS Algorithm (Link Analysis Link Analysis)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{2} k)$

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

1998

Reference

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