338 search results - page 1 / 68 » A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clu... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
PAMI
2007
13 years 4 months ago
2007
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
EMMCVPR
2001
Springer
13 years 9 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...
CVPR
2000
IEEE
13 years 9 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...