2000 character limit reached
The rank convergence of HITS can be slow
Published 18 Jul 2008 in cs.DS and cs.IR | (0807.3006v1)
Abstract: We prove that HITS, to "get right" h of the top k ranked nodes of an N>=2k node graph, can require hOmega(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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.