The rank convergence of HITS can be slow

Details The rank convergence of HITS can be slow The rank convergence of HITS can be slow

2008-07-18

arxiv.org/abs/0807.3006v1

Computer Science

Data Structures and Algorithms

5 pages, 1 figure. Keywords: algorithm analysis, information retrieval, rank convergence

Scientific paper

We prove that HITS, to "get right" h of the top k ranked nodes of an N>=2k
node graph, can require h^(Omega(N h/k)) iterations (i.e. a substantial Omega(N
h log(h)/k) matrix multiplications even with a "squaring trick"). Our proof
requires no algebraic tools and is entirely self-contained.

Affiliated with

Also associated with

No associations

Rating

The rank convergence of HITS can be slow does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The rank convergence of HITS can be slow, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The rank convergence of HITS can be slow will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-388651