Scheduled approximation for Personalized PageRank with Utility-based hub selection
As Personalized PageRank has been widely leveraged for ranking on a graph, the efficient computation of Personalized PageRank Vector (PPV) becomes a prominent issue. In this paper, we propose FastPPV, an approximate PPV computation algorithm that is incremental and accuracy-aware. Our approach hinge...
Saved in:
Main Authors: | ZHU, Fanwei, FANG, Yuan, CHANG, Kevin Chen-Chuan, YING, Jing |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2015
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4070 https://ink.library.smu.edu.sg/context/sis_research/article/5073/viewcontent/fastppv.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
HubPPR: Effective Indexing for Approximate Personalized PageRank
by: Wang, Sibo, et al.
Published: (2017) -
Distributed Algorithms on Exact Personalized PageRank
by: Guo, Tao, et al.
Published: (2017) -
Distributed PageRank computation with improved round complexities
by: Luo, Siqiang, et al.
Published: (2022) -
Incremental and accuracy-aware personalized pagerank through scheduled approximation
by: ZHU, Fanwei, et al.
Published: (2013) -
A random walk on the red carpet: Rating movies with user reviews and pagerank
by: Wijaya, D.T., et al.
Published: (2013)