Results 191 to 200 of about 10,068 (229)
SIAM Review, 2015 Google's PageRank method was developed to evaluate the importance of web-pages via their link structure. The mathematics of PageRank, however, are entirely general and apply to any graph or network in any domain. Thus, PageRank is now regularly used in bibliometrics, social and information network analysis, and for link prediction and recommendation ...
David Gleich
exaly +5 more sources
SIAM Journal on Matrix Analysis and Applications, 2015 In this paper, we first extend the celebrated PageRank modification to a higher-order Markov chain. Although this system has attractive theoretical properties, it is computationally intractable for many interesting problems. We next study a computationally tractable approximation to the higher-order PageRank vector that involves a system of polynomial ...
David Gleich, Lek-Heng Lim
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Transactions on Information Systems, 2009
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 by Brin and Page is still used. In this paper, we give a
P. Boldi, M. Santini, S. Vigna
+4 more sources
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 by Brin and Page is still used. In this paper, we give a
P. Boldi, M. Santini, S. Vigna
+4 more sources
ACM Transactions on Internet Technology, 2005
Although the interest of a Web page is strictly related to its content and to the subjective readers' cultural background, a measure of the page authority can be provided that only depends on the topological structure of the Web. PageRank is a noticeable way to attach a score to Web pages on the basis of the Web connectivity.
Monica Bianchini, Franco Scarselli
exaly +4 more sources
Although the interest of a Web page is strictly related to its content and to the subjective readers' cultural background, a measure of the page authority can be provided that only depends on the topological structure of the Web. PageRank is a noticeable way to attach a score to Web pages on the basis of the Web connectivity.
Monica Bianchini, Franco Scarselli
exaly +4 more sources
Local approximation of PageRank and reverse PageRank
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, 2008We consider the problem of approximating the PageRank of a target node using only local information provided by a link server. We prove that local approximation of PageRank is feasible if and only if the graph has low in-degree and admits fast PageRank convergence.
Ziv Bar-Yossef, Li-Tal Mashiach
openaire +3 more sources
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, 2005
PageRank has been known to be a successful algorithm in ranking web sources. In order to avoid the rank sink problem, PageRank assumes that a surfer, being in a page, jumps to a random page with a certain probability. In the standard PageRank algorithm, the jumping probabilities are assumed to be the same for all the pages, regardless of the page ...
Xuanhui Wang +2 more
openaire +2 more sources
PageRank has been known to be a successful algorithm in ranking web sources. In order to avoid the rank sink problem, PageRank assumes that a surfer, being in a page, jumps to a random page with a certain probability. In the standard PageRank algorithm, the jumping probabilities are assumed to be the same for all the pages, regardless of the page ...
Xuanhui Wang +2 more
openaire +2 more sources
Computing personalized pageranks
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04, 2004A recently published approach to adaptive page rank, using the solution of quadratic optimization methods with a set of simple constraints, is modified to permit classification of web pages according to their page contents, URLs. This modification allows the approach to be more adapted to the needs of focussed crawlers, or personalized search engines.
Franco Scarselli +2 more
openaire +3 more sources
PageRank as an Argumentation Semantics
2020This paper provides an initial exploration on the relationships between PageRank and gradual argumentation semantics. After showing that PageRank, directly interpreted as an argumentation semantics for support frameworks, fails to satisfy some generally desirable properties, we propose a novel approach to reconstruct PageRank as gradual semantics of a ...
Emanuele Albini +3 more
openaire +3 more sources
A note on the PageRank algorithm
Applied Mathematics and Computation, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huan Sun, Yimin Wei 0001
openaire +3 more sources
ACM Transactions on Internet Technology, 2006
PageRank, one part of the search engine Google, is one of the most prominent link-based rankings of documents in the World Wide Web. Usually it is described as a Markov chain modeling a specific random surfer. In this article, an alternative representation as a power series is given.
openaire +2 more sources
PageRank, one part of the search engine Google, is one of the most prominent link-based rankings of documents in the World Wide Web. Usually it is described as a Markov chain modeling a specific random surfer. In this article, an alternative representation as a power series is given.
openaire +2 more sources