Parallel-friendly personalized pageranks with operation shuffling
Given a graph G and a source node s, the single-source Personalized PageRank (SSPPR) π(s, v) measures the importance of the node v with respect to the source node s, thus SSPPR is widely adopted in many graph analysis technologies. Specifically, π(s, v) is the probability that a random walk starts...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Master by Research |
| Language: | English |
| Published: |
Nanyang Technological University
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/172018 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |