Sciweavers

11 search results - page 2 / 3
» Local approximation of pagerank and reverse pagerank
Sort
View
IM
2007
13 years 6 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
WAW
2007
Springer
113views Algorithms» more  WAW 2007»
14 years 15 days ago
Local Computation of PageRank Contributions
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
SIGIR
2008
ACM
13 years 6 months ago
Separate and inequal: preserving heterogeneity in topical authority flows
Web pages, like people, are often known by others in a variety of contexts. When those contexts are sufficiently distinct, a page's importance may be better represented by mu...
Lan Nie, Brian D. Davison
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 1 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 6 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni