Sciweavers

54 search results - page 4 / 11
» Predictive Random Graph Ranking on the Web
Sort
View
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
13 years 10 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
PODS
2006
ACM
127views Database» more  PODS 2006»
14 years 5 months ago
Evolution of page popularity under random web graph models
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
Rajeev Motwani, Ying Xu 0002
IM
2007
13 years 5 months ago
PageRank of Scale-Free Growing Networks
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it r...
Konstantin Avrachenkov, Dmitri Lebedev
CIKM
2008
Springer
13 years 7 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
13 years 11 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna