Generic damping functions for propagating importance in link-based ranking

Ricardo Baeza-Yates, Paolo Boldi, Carlos Castillo

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

This paper introduces a family of link-based ranking algorithms that propagate page importance through links. The algorithms include a damping function that decreases with distance, thus a direct link implies greater endorsement than a link via a longer path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques is of some interest per se and how different choices for the damping function affect rank quality and convergence speed. Even though our results suggest that PageRank can be approximated with other, more simple forms of rankings that may be computed more efficiently, our focus is more speculative in nature, given that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions that have, respectively, linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. The work we carry includes algorithms, analysis, comparisons, and experiments that study their behavior under different parameters in real web graph data. Amongst other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank’s using a fixed number of iterations. Comparisons were made using Kendall’s τ on large domain datasets.

Original languageEnglish
Pages (from-to)445-478
Number of pages34
JournalInternet Mathematics
Volume3
Issue number4
DOIs
Publication statusPublished - 1 Jan 2006
Externally publishedYes

Fingerprint

PageRank
Ranking
Damping
Decay
Propagation
Web Graph
Ranking Function
Path
Longest Path
Algorithm Analysis
Convergence Speed
Linear Approximation
Exponential Decay
kernel
Iteration
Imply
Calculate
Decrease
Experiment
Family

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computational Mathematics
  • Applied Mathematics

Cite this

Generic damping functions for propagating importance in link-based ranking. / Baeza-Yates, Ricardo; Boldi, Paolo; Castillo, Carlos.

In: Internet Mathematics, Vol. 3, No. 4, 01.01.2006, p. 445-478.

Research output: Contribution to journalArticle

Baeza-Yates, Ricardo ; Boldi, Paolo ; Castillo, Carlos. / Generic damping functions for propagating importance in link-based ranking. In: Internet Mathematics. 2006 ; Vol. 3, No. 4. pp. 445-478.
@article{92f7a02294e640cfaaa56e4222de6087,
title = "Generic damping functions for propagating importance in link-based ranking",
abstract = "This paper introduces a family of link-based ranking algorithms that propagate page importance through links. The algorithms include a damping function that decreases with distance, thus a direct link implies greater endorsement than a link via a longer path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques is of some interest per se and how different choices for the damping function affect rank quality and convergence speed. Even though our results suggest that PageRank can be approximated with other, more simple forms of rankings that may be computed more efficiently, our focus is more speculative in nature, given that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions that have, respectively, linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. The work we carry includes algorithms, analysis, comparisons, and experiments that study their behavior under different parameters in real web graph data. Amongst other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank’s using a fixed number of iterations. Comparisons were made using Kendall’s τ on large domain datasets.",
author = "Ricardo Baeza-Yates and Paolo Boldi and Carlos Castillo",
year = "2006",
month = "1",
day = "1",
doi = "10.1080/15427951.2006.10129134",
language = "English",
volume = "3",
pages = "445--478",
journal = "Internet Mathematics",
issn = "1542-7951",
publisher = "Taylor and Francis Ltd.",
number = "4",

}

TY - JOUR

T1 - Generic damping functions for propagating importance in link-based ranking

AU - Baeza-Yates, Ricardo

AU - Boldi, Paolo

AU - Castillo, Carlos

PY - 2006/1/1

Y1 - 2006/1/1

N2 - This paper introduces a family of link-based ranking algorithms that propagate page importance through links. The algorithms include a damping function that decreases with distance, thus a direct link implies greater endorsement than a link via a longer path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques is of some interest per se and how different choices for the damping function affect rank quality and convergence speed. Even though our results suggest that PageRank can be approximated with other, more simple forms of rankings that may be computed more efficiently, our focus is more speculative in nature, given that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions that have, respectively, linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. The work we carry includes algorithms, analysis, comparisons, and experiments that study their behavior under different parameters in real web graph data. Amongst other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank’s using a fixed number of iterations. Comparisons were made using Kendall’s τ on large domain datasets.

AB - This paper introduces a family of link-based ranking algorithms that propagate page importance through links. The algorithms include a damping function that decreases with distance, thus a direct link implies greater endorsement than a link via a longer path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques is of some interest per se and how different choices for the damping function affect rank quality and convergence speed. Even though our results suggest that PageRank can be approximated with other, more simple forms of rankings that may be computed more efficiently, our focus is more speculative in nature, given that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions that have, respectively, linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. The work we carry includes algorithms, analysis, comparisons, and experiments that study their behavior under different parameters in real web graph data. Amongst other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank’s using a fixed number of iterations. Comparisons were made using Kendall’s τ on large domain datasets.

UR - http://www.scopus.com/inward/record.url?scp=77954645364&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954645364&partnerID=8YFLogxK

U2 - 10.1080/15427951.2006.10129134

DO - 10.1080/15427951.2006.10129134

M3 - Article

AN - SCOPUS:77954645364

VL - 3

SP - 445

EP - 478

JO - Internet Mathematics

JF - Internet Mathematics

SN - 1542-7951

IS - 4

ER -