Brezinski, Claude ;
RedivoZaglia, Michela
Extrapolation and minimization procedures for the PageRank vector
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 illconditioned, 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.
BibTeX  Entry
@InProceedings{brezinski_et_al:DSP:2007:1068,
author = {Claude Brezinski and Michela RedivoZaglia},
title = {Extrapolation and minimization procedures for the PageRank vector},
booktitle = {Web Information Retrieval and Linear Algebra Algorithms},
year = {2007},
editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld},
number = {07071},
series = {Dagstuhl Seminar Proceedings},
ISSN = {18624405},
publisher = {Internationales Begegnungs und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2007/1068},
annote = {Keywords: Extrapolation, PageRank, Web matrix, eigenvector computation.}
}
2007
Keywords: 

Extrapolation, PageRank, Web matrix, eigenvector computation. 
Seminar: 

07071  Web Information Retrieval and Linear Algebra Algorithms

Related Scholarly Article: 


Issue date: 

2007 
Date of publication: 

2007 