您要查找的是不是：
- The traditional PageRank algorithm was reviewed. The problems of rank-leaking and dangle-pages were discussed. 回顾了传统的PageRank计算方式,分析了等级泄漏和悬挂页面问题的解决方法。
- The latest search engine, Google, has solved the problem with its global PageRank algorithm to some extent. 后来的搜索引擎Goolge利用自己的全局网页排名算法PageRank,较好的解决了结果的排名。
- It is clear that The N-step PageRank algorithm is the generalization of the classical one. 经典PageRank算法是N-stepPageRank算法N=1时的特殊情形。
- If a special evaluation of certain web pages shall take place, the original PageRank algorithm has to be modified. 如果一个特殊的评价会发生某些网页;原来PageRank算法已被改装.
- A distributed PageRank algorithm is put forward based on PageRank algorithm, which makes distributed ranks calculation possible. 对PageRank算法进行了扩展,提出了分布式PageRank算法,使结点可以完全异步地计算文档的重要度。
- Its convergence is proved in theory and the uniformity between its results and that of PageRank algorithm is further verified through the experiments. 并从理论上证明了它的收敛性,用实验验证了它与PageRank算法在收敛结果上的吻合性。
- Finally, we use the PageRank algorithm to calculate the similarity degree and discover synonyms in the associated word graph. 然后我们利用超链接分析方法并结合PageRank算法,计算词汇的PageRank值,把PageRank值看成是体现词汇之间语义相似性的衡量指标,最后为每一个词汇生成候选同义词集,并通过一定的筛选原则和方法,推荐出最佳的同义词。
- This paper researches the PageRank algorithm of search engine Google,and introduces its development and the improved algorithm. 深入剖析了著名搜索引擎Google的关键技术PageRank算法,介绍分析了该算法的当前发展现状。
- It aims at that the PageRank algorithm always comes forth the topic drift,so this paper uses the new idea to improve this algorithm. 并针对PageRank算法容易出现主题漂移现象,利用提出的二阶相似度改进算法。
- By analysis the structure of hyperlinks, PageRank algorithm which is applied in Google efficiently promote the result of search. Google的PageRank算法通过对超链接结构的分析，有效地提高了搜索结果的排序质量。
- The experiment results show that the Modilink can convergence faster than the PageRank algorithm and under the restricting conditions the retrieval efficiency can be improved. 对于优化的事后链接分析算法我们从理论上证明了算法的正确性和可行性，并在实验中验证了这些算法。
- Based on the study of the search engine key technology, we analyze the PageRank algorithm and propose an improvement aimed at the deficiency of the PageRank algorithm. 在研究搜索引擎关键技术和的基础上;剖析了PageRank算法;并针对PageRank算法的缺陷提出了改进方案.
- Improving the PageRank algorithm by looking N-step forward is proposed when constructing the transition probability matrix. the motivation comes from the similar "looking N-step forward" strategy that is successfully used in computer chess. 受计算机象棋算法设计中一个很成功的策略:“多看几步”的启发,改进和推广了经典PageRank算法,提出了更为一般的N-stepPageRank算法,它在计算网页的转移概率时利用了网页N步的链接信息。
- Based on the typical algorithms,an improved web structure mining algorithm,combining PageRank algorithm with HITS algorithm was presented. 在对Web结构挖掘的典型算法探讨的基础上,提出了一种PageRank算法和HITS算法相结合的改进算法,并对该算法进行了简要分析。
- After the analysis of the strategy for web page partitioning under distributed environment ,an algorithm called GroupPageRank is proposed based on the centralized PageRank algorithm. 在分析了分布式环境下网页划分的策略后; 基于集中式PageRank,给出了适于开放系统的GroupPageRank算法;
- The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing the Web link graph. 从数学上讲，PageRank算法即是求一个Markov转移矩阵中最大特征值1所对应的左特征向量。
- Improved PageRank Algorithm for Ordering Web Pages 对网页PageRank算法的改进
- Improvement of N-step PageRank Algorithm PageRank算法的改进
- Improvement of PageRank Algorithm for Search Engine 搜索引擎PageRank算法的改进
- On An Improving Strategy for the PageRank Algorithm 提高PageRank算法效率的方法初探
