101 search results - page 7 / 21 » Graph Partition by Swendsen-Wang Cuts |
KDD
2012
ACM
11 years 11 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
ICCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
CVPR
1997
IEEE
14 years 23 days ago
1997
IEEE
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...