Richardson and Domingos (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(nl)$ words (See paper (noting that sum d_q can be as high as O(nl))) == Description == Query-dependent PageRank == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2002 == Reference == https://homes.cs.washington.edu/~pedrod/papers/nips01b.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m n )$

Space Complexity

$O(nl)$ words

(See paper (noting that sum d_q can be as high as O(nl)))

Description

Query-dependent PageRank

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2002

Reference

https://homes.cs.washington.edu/~pedrod/papers/nips01b.pdf

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