Sciweavers

1839 search results - page 4 / 368
» Efficient Parallel Computation of PageRank
Sort
View
WWW
2007
ACM
14 years 8 months ago
Utility analysis for topically biased PageRank
PageRank is known to be an efficient metric for computing general document importance in the Web. While commonly used as a one-size-fits-all measure, the ability to produce topica...
Christian Kohlschütter, Paul-Alexandru Chirit...
ITA
2006
163views Communications» more  ITA 2006»
13 years 7 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
WWW
2007
ACM
14 years 8 months ago
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 evolv...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
WWW
2004
ACM
14 years 8 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 7 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi