11 search results - page 1 / 3 » Measuring Proximity on Graphs with Side Information |
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
2007
ACM
14 years 5 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
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...
WWW
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...