Introduces gossip-based and clustering-enhanced distributed algorithms for PageRank computation with claimed exponential convergence rates, shown via numerical examples on real web data.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient PageRank Computation via Distributed Algorithms with Web Clustering
Introduces gossip-based and clustering-enhanced distributed algorithms for PageRank computation with claimed exponential convergence rates, shown via numerical examples on real web data.