Distributed PageRank computation with improved round complexities
PageRank is a classic measure that effectively evaluates the importance of nodes in large graphs. It has been applied in numerous applications spanning data mining, Web algorithms, recommendation systems, load balancing, search and connectivity structures identification. Computing PageRank for large...
Main Authors: | Luo, Siqiang, Wu, Xiaowei, Kao, Ben |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161776 |
Similar Items
-
Distributed Algorithms on Exact Personalized PageRank
by: Guo, Tao, et al.
Published: (2017) -
HubPPR: Effective Indexing for Approximate Personalized PageRank
by: Wang, Sibo, et al.
Published: (2017) -
Anderson Acceleration of the Arnoldi-Inout Method for Computing PageRank
by: Xia Tang, et al.
Published: (2021-04-01) -
A Preconditioned Variant of the Refined Arnoldi Method for Computing PageRank Eigenvectors
by: Zhao-Li Shen, et al.
Published: (2021-07-01) -
The Scientific Productivity of Collective Subjects Based on the Time-Weighted PageRank Method with Citation Intensity
by: Alexander Kuchansky, et al.
Published: (2022-10-01)