skip to main content
10.1145/1242572.1242737acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
Article

Comparing apples and oranges: normalized pagerank for evolving graphs

Published: 08 May 2007 Publication History

Abstract

PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolving graph. We present an efficiently computable normalization for PageRank scores that makes them comparable across graphs. Furthermore, we show that the normalized PageRank scores are robust to non-local changes in the graph, unlike the standard PageRank measure.

References

[1]
K. Avrachenko, N. Litvak, et al. Monte Carlo methods in PageRank computation: When one iteration is sufficient. Tech. rep., INRIA Sophia Antipolis, 2005.
[2]
M. Bender, S. Michel, et al. Minerva: Collaborative P2P Search. In VLDB 2005.
[3]
K. Berberich, S. Bedathur, et al. BuzzRank.and the Trend is Your Friend In WWW 2006.
[4]
N. Eiron, K. S. McCurley, et al. Ranking the Web Frontier. In WWW 2004.
[5]
Z. Gyöngyi and H. Garcia-Molina. Link Spam Alliances. In VLDB 2005.
[6]
G. Jeh and J. Widom. Scaling Personalized Web Search. In WWW 2003.
[7]
D. Koschützki, K. Lehmann, et al. Advanced Centrality Concepts. In Vol. 3418 of LNCS. Springer, 2004.
[8]
W. Meng, C. Yu, et al. Building efficient and effective metasearch engines. ACM Comput. Surv., 34(1), 2002.
[9]
L. Page, S. Brin, et al. The PageRank Citation Ranking: Bringing Order to the Web. Stanford Tech. rep., 1998.

Cited By

View all

Index Terms

  1. Comparing apples and oranges: normalized pagerank for evolving graphs

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    WWW '07: Proceedings of the 16th international conference on World Wide Web
    May 2007
    1382 pages
    ISBN:9781595936547
    DOI:10.1145/1242572
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 08 May 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. PageRank
    2. web dynamics
    3. web graph

    Qualifiers

    • Article

    Conference

    WWW'07
    Sponsor:
    WWW'07: 16th International World Wide Web Conference
    May 8 - 12, 2007
    Alberta, Banff, Canada

    Acceptance Rates

    Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)7
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 08 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media