521 search results - page 25 / 105 » Coring method for clustering a graph |
143
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
125
click to vote
CASCON
1992
15 years 5 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
130
click to vote
CVPR
2009
IEEE
15 years 11 months ago
2009
IEEE
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...
141
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
176
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...