115 search results - page 5 / 23 » Fast approximate spectral clustering |
126
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
124
click to vote
BIODATAMINING
2008
15 years 4 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
128
click to vote
ASPDAC
1999
ACM
15 years 8 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 ...
153
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
285
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...