【摘要】 在经典PageRank算法的基础上,提出了一种适用于大规模网页链接结构的改进PageRank算法-LSIPR。该算法利用大规模网页链接邻接矩阵的稀疏性,巧妙地使用了细胞数组,缩短了算法的计算时间和乘幂迭代的迭代次数。通过仿真实验表明,同改进PageRank算法、幂迭代PageRank算法和修正PageRank算法相比,LSIPR算法在大规模网页排名方面具有很好的收敛性,可以满足工程化应用的需求。更多还原

【Abstract】 A Modified PageRank algorithm-LSIPR is proposed for large-scale Web link structure,based on classic PageRank algorithm.The algorithm uses the adjacency matrix’s sparsity of mass web link structure,uses the cell array perfectly,shorten the calculation time and power iteration method’s iteration times.The simulation experiments show that LSIPR algorithm has good convergence in large webpage ranking,compared with the improved PageRank algorithm,power iterative PageRank algorithm and modified PageRank algorithm,can meet the needs of engineering application.更多还原