50 search results - page 4 / 10 » Answering Opinion Questions with Random Walks on Graphs |
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
WAW
2007
Springer
15 years 3 months ago
2007
Springer
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of v...
73
Voted
KR
2010
Springer
15 years 2 months ago
2010
Springer
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
100
click to vote
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
105
click to vote
CCR
2004
14 years 9 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...