Kamvar, Sepandar and Haveliwala, Taher and Golub, Gene (2003) Adaptive Methods for the Computation of PageRank. Technical Report. Stanford.
We observe that the convergence patterns of pages in the PageRank algorithm have a nonuniform distribution. Specifically, many pages converge to their true PageRank quickly, while relatively few pages take a much longer time to converge. Furthermore, we observe that these slow-converging pages are generally those pages with high PageRank. We use this observation to devise a simple algorithm to speed up the computation of PageRank, in which the PageRank of pages that have converged are not recomputed at each iteration after convergence. This algorithm, which we call Adaptive PageRank, speeds up the computation of PageRank by nearly 30\%.
|Item Type:||Techreport (Technical Report)|
|Uncontrolled Keywords:||PageRank, web search|
|Subjects:||Computer Science > Databases and the Web|
|Related URLs:||Project Homepage, Project Homepage, Project Homepage||http://infolab.stanford.edu/, http://infolab.stanford.edu/, http://www-nlp.stanford.edu/|
|Deposited By:||Import Account|
|Deposited On:||27 Apr 2003 17:00|
|Last Modified:||24 Dec 2008 10:15|
Repository Staff Only: item control page