Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)

  • Gianna M. Del Corso
  • Antonio Gullí
  • Francesco Romani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3243)

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.

Keywords

Link Analysis Search Engines Web Matrix Reducibility and Permutation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Gianna M. Del Corso
    • 1
  • Antonio Gullí
    • 1
    • 2
  • Francesco Romani
    • 1
  1. 1.Dipartimento di InformaticaUniversity of PisaItaly
  2. 2.IIT-CNRPisaItaly

Personalised recommendations