Cache-Efficient Approach for Index-Free Personalized PageRank
Personalized PageRank (PPR) measures the importance of vertices with respect to a source vertex. Since real-world graphs are evolving rapidly, PPR computation methods need to be index-free and fast. Unfortunately, existing index-free methods suffer from cache misses. They follow the state-of-the-art...
Main Authors: | Kohei Tsuchida, Naoki Matsumoto, Andrew Shin, Kunitake Kaneko |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10018394/ |
Similar Items
-
An Efficient Monte Carlo Approach to Compute PageRank for Large Graphs on a Single PC
by: Sonobe Tomohiro
Published: (2016-03-01) -
Distributed Algorithms on Exact Personalized PageRank
by: Guo, Tao, et al.
Published: (2017) -
Recursive reordering and elimination method for efficient computation of PageRank problems
by: Zhao-Li Shen, et al.
Published: (2023-08-01) -
Towards PageRank Update in a Streaming Graph by Incremental Random Walk
by: Zhipeng Sun, et al.
Published: (2022-01-01) -
Efficient algorithm to compute Markov transitional probabilities for a desired PageRank
by: Gábor Berend
Published: (2020-07-01)