.png){kind=icon}
返回
Distributed Randomized Algorithms for the PageRank Computation
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2010.2042984.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the search results. The algorithm quantifies the importance of each web page based on the link structure of the web. We first provide an overview of the original problem setup. Then, we propose several distributed randomized schemes for the computation of the PageRank, where the pages can locally update their values by communicating to those connected by links. The main objective of the paper is to show that these schemes asymptotically converge in the mean-square sense to the true PageRank values. A detailed discussion on the close relations to the multi-agent consensus problems is also given.
Keyword:
Distributed computation
multi-agent consensus
PageRank algorithm
randomization
search engines
stochastic matrices
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Sensor nodes estimation for a greenhouse monitoring system using hierarchical wireless network.png)
2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)
2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)IF0
PREAI
分享收藏分享收藏
查看更多内容