350 search results - page 33 / 70 » Semidefinite spectral clustering |
ISMIR
2004
Springer
15 years 3 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
15 years 11 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...
115
click to vote
IGARSS
2009
14 years 7 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...
132
click to vote
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...