Dimension reduction2 - 4/21/2011 1 Dimension Reduction 2...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4/21/2011 1 Dimension Reduction 2 Some more detailed discussion Dealing with high dimensional data is time consuming, even when dealing with cameras and images, the images are highly compressed so that they can be used easier. They are compressed down to parameters that define the original picture. The parameters can be used to retrieve the image when needing to be viewed again. How do we perform this compression of data, or dimension reduction? Suppose we have some data points ? ? , = 1,2, , where D is very large. We want ? ? ? ? where M is a map and d<<D (much much less than). The best case would be that we can perfectly go to ? ? from ? ? and vice versa but in reality we do lose some information. We saw this with PCA ? ? = ? ? ? 4/21/2011 2 Our situation: ? = ? 1 , ? 2 , , ? D is very large Come up with a mapping to get ? = ?...
View Full Document

This note was uploaded on 01/16/2012 for the course MAD 4103 taught by Professor Li during the Spring '11 term at University of Central Florida.

Page1 / 5

Dimension reduction2 - 4/21/2011 1 Dimension Reduction 2...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online