325 search results - page 28 / 65 » On Clusterings - Good, Bad and Spectral |
KDD
2005
ACM
14 years 8 months 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...
ISMIR
2004
Springer
14 years 1 months ago
2004
Springer
In order to map the spectral characteristics of the large variety of sounds a musical instrument may produce, different notes were performed and sampled in several intensity level...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algori...
IGARSS
2009
13 years 6 months ago
2009
We have explored in this paper a framework to test in a quantitative manner the stability of different endmember extraction and spectral unmixing algorithms based on the concept o...
PAMI
2007
13 years 8 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....