PHITS Coheng Chan (Link Analysis Link Analysis)

Time Complexity

$O(m n )$

Space Complexity

$O(nz)$? words

(Needs to store P(z), P(d|z), and P(c|z) after each EM iteration (algorithm can be smart about intermediate calculations as to not use more than O(nz) space))

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2000

Reference

http://web.cse.msu.edu/~cse960/Papers/LinkAnalysis/phits.pdf