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...
Saved in:
Main Authors: | Luo, Siqiang, Wu, Xiaowei, Kao, Ben |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161776 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
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) -
Scheduled approximation for Personalized PageRank with Utility-based hub selection
by: ZHU, Fanwei, et al.
Published: (2015) -
A random walk on the red carpet: Rating movies with user reviews and pagerank
by: Wijaya, D.T., et al.
Published: (2013) -
Google and the PageRank algorithm
by: Morales, John Vincent S., et al.
Published: (2013)