45 search results - page 1 / 9 » Using a Layered Markov Model for Distributed Web Ranking Com... |
ICDCS
2005
IEEE
13 years 10 months ago
2005
IEEE
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 ...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
ESWS
2010
Springer
13 years 9 months ago
2010
Springer
On the Web of Data, entities are often interconnected in a way similar to web documents. Previous works have shown how PageRank can be adapted to achieve entity ranking. In this pa...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
ICTIR
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In the rapidly evolving and growing environment of the internet, web site owners aim to maximize interest for their web site. In this article we propose a model, which co...