.png){kind=icon}
Return
Distributed Randomized PageRank Algorithm Based on Stochastic Approximation
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2014.2359311.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A distributed randomized PageRank algorithm based on stochastic approximation (SA) is proposed to estimate the importance scores of web pages. Compared with the existing methods, the algorithm given here has wider applications in the sense that it can deal with a larger class of randomizations. The strong consistency of the estimates is proved, and the robustness of the PageRank value is analyzed as well. Numerical examples are given to verify the obtained theoretic results.
Keywords:
Distributed randomized PageRank algorithm
stochastic approximation
strong consistency
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
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
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveIonic Liquids: Versatile Media for Preparation of Vesicles from Polymerization-Induced Self-Assembly
PREAI
ShareSave
ShareSave
View more