Sciweavers

4052 search results - page 16 / 811
» Computing personalized pageranks
Sort
View
WWW
2004
ACM
15 years 10 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
14 years 7 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
97
Voted
IM
2007
14 years 9 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
ICML
2008
IEEE
15 years 10 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash