When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-10606
Go to the corresponding Portal

Kollias, Giorgios ; Gallopoulos, Efstratios

Multidamping simulation framework for link-based ranking

07071.GallopoulosEfstratios.Paper.1060.pdf (0.6 MB)


We review methods for the approximate computation of PageRank. Standard methods are based on the eigenvector and linear system characterizations. Our starting point are recent methods based on series representation whose coefficients are damping functions, for example Linear Rank, HyperRank and TotalRank, etc. We propose a multidamping framework for interpreting PageRank and these methods. Multidamping is based on some new useful properties of Google type matrices. The approach can be generalized and could help in the exploration of new approximations for list-based ranking. This is joint work with Georgios Kollias and is supported by a Pythagoras-EPEAEK-II grant.

BibTeX - Entry

  author =	{Giorgios Kollias and Efstratios Gallopoulos},
  title =	{Multidamping simulation framework for link-based ranking},
  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 =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: PageRank, Google, power method, eigenvalues, teleportation, list-based ranking, TotalRank}

Keywords: PageRank, Google, power method, eigenvalues, teleportation, list-based ranking, TotalRank
Seminar: 07071 - Web Information Retrieval and Linear Algebra Algorithms
Issue Date: 2007
Date of publication: 28.06.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI