Étude comparative des méthodes de calcul de PageRank

msra

引用 23|浏览1
暂无评分
摘要
In this paper we have analyzed, while varying the damping factor, convergence in time and iterations of two classes of methods for solving the PageRank problem. The first class consists in extrapolation methods and the second in iterative methods. Our experiments have shown that Krylov methods are generally the fastest.
更多
查看译文
关键词
web graph,chaîne de markov,markov chain,espace de krylov keywords : pagerank,mots-clés : pagerank,krylov space,graphe du web
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要