Comparing apples and oranges: normalized pagerank for evolving graphs

Klaus Berberich, Srikanta J. Bedathur, Gerhard Weikum, Michalis Vazirgiannis

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.
BibTeX
@inproceedings{berberich2007comparing,
  author = {Klaus Berberich and Srikanta J. Bedathur and Gerhard Weikum and Michalis Vazirgiannis},
  title = {{Comparing apples and oranges: normalized pagerank for evolving graphs}},
  booktitle = {The Web Conference},
  year = {2007},
  doi = {10.1145/1242572.1242737},
}

Loading related content...

Figure