HITS CAN CONVERGE SLOWLY, BUT NOT TOO SLOWLY, IN SCORE AND RANK

被引：1
|
作者：
Peserico, Enoch [1 ]
Pretto, Luca [2 ]
机构：
[1] Univ Padua, Dip Ingn Informaz, I-35131 Padua, Italy
[2] Univ Padua, Dip Ingn Ind, I-35131 Padua, Italy
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2012年 / 26卷 / 03期
关键词：
link analysis; HITS; convergence; rank; ALGORITHM; SALSA;
D O I：
10.1137/090762002
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This article explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in rank (i.e. to "get right" the order of the nodes). We prove upper and almost matching lower bounds. We also extend our results to weighted graphs.
引用
收藏
页码：1189 / 1209
页数：21
相关论文
共 50 条
12345