1775 search results - page 45 / 355 » Learning Spectral Clustering |
NECO
2008
15 years 1 months ago
2008
130
click to vote
JMLR
2010
14 years 8 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
ISMIR
2004
Springer
15 years 6 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
16 years 2 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...
131
click to vote
IDA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The underdetermined blind audio source separation problem is often addressed in the time-frequency domain by assuming that each time-frequency point is an independently d...