Optimized on-line computation of PageRank algorithm
arXiv:1202.6158
Abstract
In this paper we present new ideas to accelerate the computation of the eigenvector of the transition matrix associated to the PageRank algorithm. New ideas are based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model, associated to new algebraic equations. We show through experiments on synthetic data and on real data-sets how much this approach can improve the computation efficiency.
7 pages
References in corpus (1)
Cited by in corpus (14)
- D-iteration method or how to improve Gauss-Seidel method
- Revisiting the D-iteration method: from theoretical to practical computation cost
- Red Light Green Light Method for Solving Large Markov Chains
- D-iteration: Evaluation of the Asynchronous Distributed Computation
- D-iteration based asynchronous distributed computation
- D-iteration: Evaluation of a Dynamic Partition Strategy
- Understanding differential equations through diffusion point of view: non-symmetric discrete equations
- Understanding differential equations through diffusion point of view
- Optimizing the eigenvector computation algorithm with diffusion approach
- Introducing One Step Back Iterative Approach to Solve Linear and Non Linear Fixed Point Problem
- Note on the equations of diffusion operators associated to a positive matrix
- D-iteration: evaluation of the update algorithm
- Convergence of the D-iteration algorithm: convergence rate and asynchronous distributed scheme
- Revisiting the D-iteration method: runtime comparison