7 search results - page 1 / 2 » On the Convergence of Spectral Clustering on Random Samples:... |
COLT
2004
Springer
13 years 9 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
NIPS
2004
13 years 5 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...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
TIP
2010
12 years 11 months ago
2010
In this paper, we propose a new image clustering algorithm, referred to as Clustering using Local Discriminant Models and Global Integration (LDMGI). To deal with the data points s...
TIT
2002
13 years 3 months ago
2002
This paper considers the problem of estimating the parameters of real-valued two-dimensional (2-D) sinusoidal signals observed in colored noise. This problem is a special case of t...