HubPPR: Effective Indexing for Approximate Personalized PageRank
Personalized PageRank (PPR) computation is a fundamental operation in web search, social networks, and graph analysis. Given a graph G, a source s, and a target t, the PPR query Π(s, t) returns the probability that a random walk on G starting from s terminates at t. Unlike global PageRank which can...
Saved in:
Main Authors: | Wang, Sibo, Tang, Youze, Xiao, Xiaokui, Yang, Yin, Li, Zengxiang |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81350 http://hdl.handle.net/10220/43455 |
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) -
Distributed PageRank computation with improved round complexities
by: Luo, Siqiang, et al.
Published: (2022) -
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)