Comparing apples and oranges: normalized pagerank for evolving graphs

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. Categories and Subject Descriptors: H.4.m [Information Systems]: Miscellaneous General Terms: Algorithms, Measurement

• Type: Conference
• Year: 2007
• Where: WWW
• Authors: Klaus Berberich, Srikanta J. Bedathur, Gerhard Weikum, Michalis Vazirgiannis
• Keywords: Computed Importance Scores, Internet Technology, Normalized Pagerank Scores, Standard Pagerank Measure, WWW 2007