Sciweavers

140 search results - page 8 / 28
» An efficient algorithm to rank Web resources
Sort
View
WWW
2005
ACM
14 years 7 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
SIGIR
2004
ACM
14 years 4 days ago
Learning effective ranking functions for newsgroup search
Web communities are web virtual broadcasting spaces where people can freely discuss anything. While such communities function as discussion boards, they have even greater value as...
Wensi Xi, Jesper Lind, Eric Brill
ITA
2006
163views Communications» more  ITA 2006»
13 years 6 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
SIGIR
2009
ACM
14 years 1 months ago
Personalized tag recommendation using graph-based ranking on multi-type interrelated objects
Social tagging is becoming increasingly popular in many Web 2.0 applications where users can annotate resources (e.g. Web pages) with arbitrary keywords (i.e. tags). A tag recomme...
Ziyu Guan, Jiajun Bu, Qiaozhu Mei, Chun Chen, Can ...
WWW
2004
ACM
14 years 7 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit