Sciweavers

156 search results - page 5 / 32
» Local Graph Partitioning using PageRank Vectors
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 8 days ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
ICDCS
2005
IEEE
13 years 11 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer
WWW
2004
ACM
14 years 6 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...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
13 years 11 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
SIGIR
2004
ACM
13 years 10 months ago
Block-level link analysis
Link Analysis has shown great potential in improving the performance of web search. PageRank and HITS are two of the most popular algorithms. Most of the existing link analysis al...
Deng Cai, Xiaofei He, Ji-Rong Wen, Wei-Ying Ma