Sciweavers

54 search results - page 2 / 11
» Predictive Random Graph Ranking on the Web
Sort
View
CIKM
2008
Springer
13 years 6 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
COLING
2010
12 years 12 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
ITA
2006
163views Communications» more  ITA 2006»
13 years 4 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...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 6 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
ML
2010
ACM
185views Machine Learning» more  ML 2010»
12 years 11 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal