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

62 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
Publication statusPublished - 31 Oct 2006
Event29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval - Seatttle, WA, United States
Duration: 6 Aug 200611 Aug 2006

Publication series

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

Other

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

    Fingerprint

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 (pp. 308-315). (Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval; Vol. 2006).