English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Comparing Apples and Oranges: Normalized PageRank for Evolving Graphs

MPS-Authors
/persons/resource/persons44119

Berberich,  Klaus
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons44104

Bedathur,  Srikanta
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45660

Vazirgiannis,  Michalis
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Berberich, K., Bedathur, S., Vazirgiannis, M., & Weikum, G. (2007). Comparing Apples and Oranges: Normalized PageRank for Evolving Graphs. In C. L. Williamson, M. E. Zurko, P. F. Patel-Schneider, & P. J. Shenoy (Eds.), WWW 2007: 16th International World Wide Web Conference (pp. 1145-1146). New York, NY, USA: ACM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1E94-4
Abstract
Page\-Rank 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 Page\-Rank scores that makes them comparable across graphs. Furthermore, we show that the normalized Page\-Rank scores are robust to non-local changes in the graph, unlike the standard Page\-Rank measure.