Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
The Journal of Machine Learning Research
Algorithms for estimating relative importance in networks
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Local methods for estimating pagerank values
Proceedings of the thirteenth ACM international conference on Information and knowledge management
A uniform approach to accelerated PageRank computation
WWW '05 Proceedings of the 14th international conference on World Wide Web
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Local Graph Partitioning using PageRank Vectors
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fast Random Walk with Restart and Its Applications
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
IEEE Transactions on Knowledge and Data Engineering
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Fast algorithms for topk personalized pagerank queries
Proceedings of the 17th international conference on World Wide Web
Pagerank based clustering of hypertext document collections
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Using ghost edges for classification in sparsely labeled networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Numerical Recipes 3rd Edition: The Art of Scientific Computing
Numerical Recipes 3rd Edition: The Art of Scientific Computing
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
ItemRank: a random-walk based scoring algorithm for recommender engines
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
CiteData: a new multi-faceted dataset for evaluating personalized search performance
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Exploiting user interests for collaborative filtering: interests expansion via personalized ranking
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Fast incremental and personalized PageRank
Proceedings of the VLDB Endowment
Patterns of temporal variation in online media
Proceedings of the fourth ACM international conference on Web search and data mining
Handbook of Mathematical Induction: Theory and Applications
Handbook of Mathematical Induction: Theory and Applications
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Collective graph identification
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Semi-supervised ranking on very large graphs with rich metadata
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Quick detection of top-k personalized pagerank lists
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Fast and exact top-k search for random walk with restart
Proceedings of the VLDB Endowment
Efficient ad-hoc search for personalized PageRank
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
ASCOS: an asymmetric network structure COntext similarity measure
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Incremental and accuracy-aware personalized pagerank through scheduled approximation
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Personalize PageRank (PPR) is an effective relevance (proximity) measure in graph mining. The goal of this paper is to efficiently compute single node relevance and top-k/highly relevant nodes without iteratively computing the relevances of all nodes. Based on a "random surfer model", PPR iteratively computes the relevances of all nodes in a graph until convergence for a given user preference distribution. The problem with this iterative approach is that it cannot compute the relevance of just one or a few nodes. The heart of our solution is to compute single node relevance accurately in non-iterative manner based on sparse matrix representation, and to compute top-k/highly relevant nodes exactly by pruning unnecessary relevance computations based on upper/lower relevance estimations. Our experiments show that our approach is up to seven orders of magnitude faster than the existing alternatives.