Comparing apples and oranges: normalized pagerank for evolving graphs

Authors:
Klaus Berberich;Srikanta Bedathur;Gerhard Weikum;Michalis Vazirgiannis
Affiliations:
Max-Planck Institute for Informatics;Max-Planck Institute for Informatics;Max-Planck Institute for Informatics;INRIA/FUTURS
Venue:
Proceedings of the 16th international conference on World Wide Web
Year:
2007

Citing 6
Cited 3

Building efficient and effective metasearch engines

ACM Computing Surveys (CSUR)
Scaling personalized web search

WWW '03 Proceedings of the 12th international conference on World Wide Web
Ranking the web frontier

Proceedings of the 13th international conference on World Wide Web
Link spam alliances

VLDB '05 Proceedings of the 31st international conference on Very large data bases
MINERVA: collaborative P2P search

VLDB '05 Proceedings of the 31st international conference on Very large data bases
BuzzRank … and the trend is your friend

Proceedings of the 15th international conference on World Wide Web

A pocket guide to web history

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
On popularity quality: growth and decay phases of publication popularities

IIT'09 Proceedings of the 6th international conference on Innovations in information technology
Freshness matters: in flowers, food, and web authority

Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval

Quantified Score

Hi-index	0.00

Visualization

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.