Sciweavers

Share
ALT
2008
Springer

Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces

9 years 5 months ago
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can be specialized to Kmeans clustering, nonnegative matrix factorization and the sparse coding techniques introduced by Olshausen and Field.
Andreas Maurer, Massimiliano Pontil
Added 14 Mar 2010
Updated 14 Mar 2010
Type Conference
Year 2008
Where ALT
Authors Andreas Maurer, Massimiliano Pontil
Comments (0)
books