Efficient and scalable techniques for pagerank-based graph analytics
Graphs are ubiquitous today and are a fundamental data structure to represent objects and their relations in various domains, e.g., social science, citation analysis, weblink analysis, and biological informatics. PageRank-based techniques such as personalized PageRank, heat kernel PageRank, TrustRan...
Saved in:
Main Author: | Yang, Renchi |
---|---|
Other Authors: | Sourav S Bhowmick |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/145185 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Efficient query processing on large graphs
by: Zhu, Diwen
Published: (2014) -
Efficient techniques for subgraph mining and query processing
by: Lin, Wenqing
Published: (2015) -
Efficient and scalable processing of visual property graph queries
by: Wang, Tianyu
Published: (2024) -
Parallel personalized pagerank on dynamic graphs
by: GUO, Wentian, et al.
Published: (2017) -
Graph OLAP: Towards Online Analytical Processing on Graphs
by: CHEN, CHEN, et al.
Published: (2008)