961 search results - page 16 / 193 » Significance-Driven Graph Clustering |
82
Voted
LAWEB
2003
IEEE
15 years 5 months ago
2003
IEEE
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
129
click to vote
PAMI
2007
15 years 2 days ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
121
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
106
Voted
NIPS
2004
15 years 2 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
82
Voted
GD
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...