Sciweavers

4052 search results - page 17 / 811
» Computing personalized pageranks
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 3 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
WWW
2004
ACM
15 years 10 months ago
The powerrank web link analysis algorithm
The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this p...
Yizhou Lu, Benyu Zhang, Wensi Xi, Zheng Chen, Yi L...
WWW
2005
ACM
15 years 10 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
WWW
2008
ACM
15 years 10 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
SAINT
2003
IEEE
15 years 2 months ago
A Proposal of the Person-centered Approach for Personal Task Management
This paper proposes a person-centered approach for personal task management in which people can decide management of their tasks according to their environments including their su...
Ikki Ohmukai, Hideaki Takeda, Mitsunori Miki