This paper studies a family of link-based algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with the distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our analysis includes a comparison among them and experiments for studying their behavior under different parameters.(more)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Report
%1 baeza05choice
%A Baeza-Yates, Ricardo
%A Boldi, Paolo
%A Castillo, Carlos
%D 2005
%K ranking, web-graph
%T The Choice of a Damping Function for Propagating Importance in Link-Based Ranking
%U http://boldi.dsi.unimi.it/download/TRdampingWithCover.pdf
%X This paper studies a family of link-based algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with the distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our analysis includes a comparison among them and experiments for studying their behavior under different parameters.
@techreport{baeza05choice,
abstract = {This paper studies a family of link-based algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with the distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our analysis includes a comparison among them and experiments for studying their behavior under different parameters.},
added-at = {2009-08-06T15:16:38.000+0200},
author = {Baeza-Yates, Ricardo and Boldi, Paolo and Castillo, Carlos},
biburl = {https://www.bibsonomy.org/bibtex/2fedc330524f2a975a974a098711f9370/chato},
citeulike-article-id = {322774},
citeulike-linkout-0 = {http://boldi.dsi.unimi.it/download/TRdampingWithCover.pdf},
citeulike-linkout-1 = {http://www.dcc.uchile.cl/\%7Eccastill/papers/baeza05\_choice\_damping\_factor\_importance\_link\_ranking.pdf},
institution = {Dipartimento di Scienze dell'Informazione, Universit\`{a} degli Studi di Milano},
interhash = {6c18e2240f15d2fa6af514ae88f4fa38},
intrahash = {fedc330524f2a975a974a098711f9370},
keywords = {ranking, web-graph},
month = {September},
posted-at = {2005-09-16 16:41:56},
priority = {0},
timestamp = {2009-08-06T15:16:54.000+0200},
title = {The Choice of a Damping Function for Propagating Importance in Link-Based Ranking},
url = {http://boldi.dsi.unimi.it/download/TRdampingWithCover.pdf},
year = 2005
}