Sciweavers

99 search results - page 8 / 20
» Incremental page rank computation on evolving graphs
Sort
View
ICPADS
2005
IEEE
14 years 1 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
WWW
2005
ACM
14 years 8 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
ICTIR
2009
Springer
14 years 7 days ago
Optimizing WebPage Interest
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...
Willem Elbers, Theo P. van der Weide
CIKM
2004
Springer
14 years 1 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
WEBI
2010
Springer
13 years 5 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet