74 search results - page 1 / 15 » Fast incremental proximity search in large graphs |
ICML
2008
IEEE
14 years 5 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...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
WWW
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
CORR
2012
Springer
12 years 18 days ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...