4 search results - page 1 / 1 » A Sharp PageRank Algorithm with Applications to Edge Ranking... |
WAW
2010
Springer
13 years 2 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
SIGIR
2006
ACM
13 years 10 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...