Document Open Access Logo

Extrapolation and minimization procedures for the PageRank vector

Authors Claude Brezinski, Michela Redivo-Zaglia

PDF

File

Thumbnail PDF
PDF
DagSemProc.07071.9.pdf
  • Filesize: 157 kB
  • 6 pages

Document Identifiers

Subject Classification

Keywords
  • Extrapolation
  • PageRank
  • Web matrix
  • eigenvector computation.

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

An important problem in Web search is to determine the importance of
each page. This problem consists in computing, by the power method,
the left principal eigenvector (the PageRank vector) of a matrix
depending on a parameter $c$ which has to be chosen close to 1.
However, when $c$ is close to 1, the problem is ill-conditioned, and
the power method converges slowly. So, the idea developed in this
paper consists in computing the PageRank vector for several values
of $c$, and then to extrapolate them, by a conveniently chosen
rational function, at a point near 1. The choice of this
extrapolating function is based on the mathematical considerations
about the PageRank vector.

Cite As Get BibTex

Claude Brezinski and Michela Redivo-Zaglia. Extrapolation and minimization procedures for the PageRank vector. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/DagSemProc.07071.9

Author Details

Claude Brezinski
Michela Redivo-Zaglia
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact