Results 1  10
of
404,086
TopicSensitive PageRank
, 2002
"... In the original PageRank algorithm for improving the ranking of searchquery results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search resu ..."
Abstract

Cited by 535 (10 self)
 Add to MetaCart
In the original PageRank algorithm for improving the ranking of searchquery results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search
Generalizing pagerank: Damping functions for linkbased ranking algorithms
 In Proceedings of ACM SIGIR
"... This paper introduces a family of linkbased ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ran ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
This paper introduces a family of linkbased ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known
PageRank: Functional Dependencies
"... PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spreads uniformly part of the rank. The choice of α is eminently empirical, and in most cases the original suggestion α = 0.85 ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spreads uniformly part of the rank. The choice of α is eminently empirical, and in most cases the original suggestion α = 0
PageRank as a Function of the Damping Factor
, 2005
"... PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor # that spreads uniformly part of the rank. The choice of # is eminently empirical, and in most cases the original suggestion # = 0.85 ..."
Abstract

Cited by 59 (10 self)
 Add to MetaCart
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor # that spreads uniformly part of the rank. The choice of # is eminently empirical, and in most cases the original suggestion # = 0
Local Approximation of PageRank and Reverse PageRank
"... We consider the problem of approximating the PageRank of a target node using only local information provided by a link server. This problem was originally studied by Chen, Gan, and Suel (CIKM 2004), who presented an algorithm for tackling it. We prove that local approximation of PageRank, even to wi ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We consider the problem of approximating the PageRank of a target node using only local information provided by a link server. This problem was originally studied by Chen, Gan, and Suel (CIKM 2004), who presented an algorithm for tackling it. We prove that local approximation of PageRank, even
Weighted PageRank algorithm
 Communication Networks and Services Research, 2004. Proceedings. Second Annual Conference
, 2004
"... With the rapid growth of the Web, users get easily lost in the rich hyper structure. Providing relevant information to the users to cater to their needs is the primary goal of website owners. Therefore, finding the content of the Web and retrieving the users ’ interests and needs from their behavi ..."
Abstract

Cited by 71 (0 self)
 Add to MetaCart
, HITS and PageRank, are commonly used in web structure mining. Both algorithms treat all links equally when distributing rank scores. Several algorithms have been developed to improve the performance of these methods. The Weighted PageRank algorithm (WPR), an extension to the standard PageRank
Usage Aware PageRank
 In WWW12 Poster Proceedings
, 2003
"... Traditional link analysis approaches assume equal weights assigned to different links and pages. In original PageRank formulation, the user model assumes that the user has equal probability to follow each link from a given page, thus the score of a page equally affects all of the pages it points to. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
with the usage graph that will be obtained via web logs or other means. It is also quite general; how much emphasis will be given to the graphs is controlled by a parameter. If the parameter is set to zero, the algorithm becomes equivalent to the original PageRank, if it is set to one, the emphasis shifts
PageRank for Product Image Search
 IN: WWW 2008. REFEREED TRACK: RICH MEDIA
, 2008
"... In this paper, we cast the imageranking problem into the task of identifying “authority” nodes on an inferred visual similarity graph and propose an algorithm to analyze the visual link structure that can be created among a group of images. Through an iterative procedure based on the PageRank compu ..."
Abstract

Cited by 65 (0 self)
 Add to MetaCart
In this paper, we cast the imageranking problem into the task of identifying “authority” nodes on an inferred visual similarity graph and propose an algorithm to analyze the visual link structure that can be created among a group of images. Through an iterative procedure based on the PageRank
Models and Algorithms for PageRank Sensitivity
, 2009
"... in my opinion, it is fully adequate in scope ..."
Results 1  10
of
404,086