dPageRank——一种改进的分布式PageRank算法  

dPageRank—Improved distributed PageRank algorithm

作　　者：陈再良[1] 凌力[1] 周强[1] 

机构地区：[1]复旦大学通信科学与工程系,上海200433

出　　处：《计算机应用》2006年第1期21-24,36,共5页journal of Computer Applications

摘　　要：回顾了传统的PageRank计算方式,分析了等级泄漏和悬挂页面问题的解决方法。介绍了分布式PageRank的计算原理和评价原则,在分析两种现有分布式PageRank算法的基础上,提出了一种改进的分布式PageRank算法,通过实验对该算法的性能进行分析评价。The traditional PageRank algorithm was reviewed. The problems of rank-leaking and dangle-pages were discussed. Then the theory and evaluation standard of distributed PageRank algorithm were introduced, and two published experimental algorithms were discussed. After that, a new distributed PageRank algorithm was proposed, and an experiment was set up to analyze the performance of this algorithm. At last, the conclusions were summarized and future research directions were discussed.

关 键 词：搜索引擎 PAGERANK 分布式 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP309[自动化与计算机技术—计算机科学与技术]