Sciweavers

WAW
2007
Springer
77views Algorithms» more  WAW 2007»
14 years 6 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
WAW
2009
Springer
187views Algorithms» more  WAW 2009»
14 years 7 months ago
Cluster Based Personalized Search
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [19], we develop and imple...
Hyun Chul Lee, Allan Borodin
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
14 years 7 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy