两种改进前推并行PageRank算法
Two Parallel PageRank Algorithms via Improving Forward Push
摘要:
PageRank最初用于对网页进行排名,现在已经应用到许多领域。随着图形规模的不断扩大,迫切需要加速PageRank计算,设计并行算法是一种可行的解决方案。本文通过对现有的Personalized PageRank算法进行改进,提出了两种并行PageRank算法IFP1和IFP2,向前推。理论分析表明,IFP1可以利用图的DAG结构,其中悬挂顶点提高了收敛速度,未引用的顶点减少了计算量。作为IFP1的改进,IFP2只将质量推到悬挂顶点一次,而是多次,从而进一步减少了计算量。在6个数据集上的实验表明,IFP1和IFP2的性能都优于Power方法,其中具有38个并行度的IFP2最多可以是Power方法的50倍。
英文摘要:
Initially used to rank web pages, PageRank has now been applied in many fields. With the growing scale of graph, accelerating PageRank computing is urged and designing parallel algorithm is a feasible solution. In this paper, two parallel PageRank algorithms IFP1 and IFP2 are proposed via improving the state-of-the-art Personalized PageRank algorithm, i.e., Forward Push. Theoretical analysis indicates that, IFP1 can take advantage of the DAG structure of the graph, where the dangling vertices improves the convergence rate and the unreferenced vertices decreases the computation amount. As an improvement of IFP1, IFP2 pushes mass to the dangling vertices only once but rather many times, and thus decreases the computation amount further. Experiments on six data sets illustrate that both IFP1 and IFP2 outperform Power method, where IFP2 with 38 parallelism can be at most 50 times as fast as the Power method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。