K-Dimensional Coding Schemes in Hilbert Spaces

Details K-Dimensional Coding Schemes in Hilbert Spaces K-Dimensional Coding Schemes in Hilbert Spaces

2010-02-03

arxiv.org/abs/1002.0832v1

IEEE Transactions on Information Theory, 56(11): 5839-5846, 2010

Statistics

Machine Learning

17 pages

Scientific paper

This paper presents a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The method is based on empirical risk minimization within a certain class of linear operators, which map the set of coding vectors to the Hilbert space. Two results bounding the expected reconstruction error of the method are derived, which highlight the role played by the codebook and the class of linear operators. The results are specialized to some cases of practical importance, including K-means clustering, nonnegative matrix factorization and other sparse coding methods.

Affiliated with

Also associated with

No associations

Rating

K-Dimensional Coding Schemes in Hilbert Spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with K-Dimensional Coding Schemes in Hilbert Spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K-Dimensional Coding Schemes in Hilbert Spaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154063