90 search results - page 2 / 18 » Spectral Clustering by Recursive Partitioning |
SC
1995
ACM
13 years 9 months ago
1995
ACM
The design of a parallel implementation of multilevel recursive spectral bisection on the Cray T3D is described. The code is intended to be fast enough to enable dynamic repartiti...
GFKL
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
ASPDAC
1999
ACM
13 years 10 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
NIPS
2004
13 years 7 months ago
2004
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
JMLR
2006
13 years 5 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...