157 search results - page 3 / 32 » Symmetrizations for clustering directed graphs |
AAAI
2008
13 years 7 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
HIPC
2005
Springer
13 years 10 months ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
VIP
2000
13 years 6 months ago
2000
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
ECML
2006
Springer
13 years 8 months ago
2006
Springer
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...
FSTTCS
2009
Springer
13 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...