115 search results - page 3 / 23 » Fast approximate spectral clustering |
107
Voted
GD
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
ICMLA
2008
15 years 1 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
113
Voted
KDD
2005
ACM
16 years 25 days ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
110
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
109
click to vote
PAMI
2011
14 years 7 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...