Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)
The research community has devoted an increased attention to reduce the computation time needed by Web ranking algorithms. Many efforts have been devoted to improve PageRank [4, 23], the well known ranking algorithm used by Google. The core of PageRank exploits an iterative weight assignment of ranks to the Web pages, until a fixed point is reached. This fixed point turns out to be the (dominant) eigenpair of a matrix derived by the Web Graph itself.
KeywordsLink Analysis Search Engines Web Matrix Reducibility and Permutation
Unable to display preview. Download preview PDF.