Generalizing PageRank: Damping functions for link-based ranking algorithms

Ricardo Baeza-Yates, Paolo Boldi, Carlos Castillo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

61 Citations (Scopus)

Abstract

This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with 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. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that Page-Rank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in 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, 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 presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to Page-Rank's using a fixed small number of iterations; comparisons were performed using Kendall's τ on large domain datasets.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Pages308-315
Number of pages8
Volume2006
Publication statusPublished - 31 Oct 2006
Externally publishedYes
Event29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval - Seatttle, WA, United States
Duration: 6 Aug 200611 Aug 2006

Other

Other29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
CountryUnited States
CitySeatttle, WA
Period6/8/0611/8/06

Fingerprint

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

Keywords

  • Link analysis
  • Link-based ranking
  • Web graphs

ASJC Scopus subject areas

  • Engineering(all)
  • Information Systems
  • Software
  • Applied Mathematics

Cite this

Baeza-Yates, R., Boldi, P., & Castillo, C. (2006). Generalizing PageRank: Damping functions for link-based ranking algorithms. In Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (Vol. 2006, pp. 308-315)

Generalizing PageRank : Damping functions for link-based ranking algorithms. / Baeza-Yates, Ricardo; Boldi, Paolo; Castillo, Carlos.

Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Vol. 2006 2006. p. 308-315.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baeza-Yates, R, Boldi, P & Castillo, C 2006, Generalizing PageRank: Damping functions for link-based ranking algorithms. in Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. vol. 2006, pp. 308-315, 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seatttle, WA, United States, 6/8/06.
Baeza-Yates R, Boldi P, Castillo C. Generalizing PageRank: Damping functions for link-based ranking algorithms. In Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Vol. 2006. 2006. p. 308-315
Baeza-Yates, Ricardo ; Boldi, Paolo ; Castillo, Carlos. / Generalizing PageRank : Damping functions for link-based ranking algorithms. Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Vol. 2006 2006. pp. 308-315
@inproceedings{b0c4ba0f3d8a4edd87acff5a547ab39c,
title = "Generalizing PageRank: Damping functions for link-based ranking algorithms",
abstract = "This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with 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. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that Page-Rank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in 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, 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 presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to Page-Rank's using a fixed small number of iterations; comparisons were performed using Kendall's τ on large domain datasets.",
keywords = "Link analysis, Link-based ranking, Web graphs",
author = "Ricardo Baeza-Yates and Paolo Boldi and Carlos Castillo",
year = "2006",
month = "10",
day = "31",
language = "English",
isbn = "1595933697",
volume = "2006",
pages = "308--315",
booktitle = "Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval",

}

TY - GEN

T1 - Generalizing PageRank

T2 - Damping functions for link-based ranking algorithms

AU - Baeza-Yates, Ricardo

AU - Boldi, Paolo

AU - Castillo, Carlos

PY - 2006/10/31

Y1 - 2006/10/31

N2 - This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with 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. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that Page-Rank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in 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, 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 presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to Page-Rank's using a fixed small number of iterations; comparisons were performed using Kendall's τ on large domain datasets.

AB - This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with 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. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that Page-Rank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in 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, 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 presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to Page-Rank's using a fixed small number of iterations; comparisons were performed using Kendall's τ on large domain datasets.

KW - Link analysis

KW - Link-based ranking

KW - Web graphs

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

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

M3 - Conference contribution

AN - SCOPUS:33750372419

SN - 1595933697

SN - 9781595933690

VL - 2006

SP - 308

EP - 315

BT - Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

ER -