329 search results - page 2 / 66 » Graph-Theoretic Approach to Clustering and Segmentation |
PR
2007
13 years 3 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
CVPR
1999
IEEE
14 years 6 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
BMCBI
2011
12 years 11 months ago
2011
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
WG
2010
Springer
13 years 2 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
EMMCVPR
2001
Springer
13 years 8 months ago
2001
Springer
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...