flâneur

machine learning - Sparse coding vs. sparse PCA, are they the same thing? - Cross Validated

stats.stackexchange.com · 1,382 words · saved by 1 readers

Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams Teams Q&A for work Connect and share knowledge within a single location that is structured and easy to search. Are they the same thing? If not, could someone possibly explain the difference or point to the seminal papers describing the approaches? I am looking not for a detailed technical exposition, but a general taxonomy of the algorithms. For example, are both of them for dimensionality reduction? [NB: my original answer was not entirely correct. I revised it now.] Sparse coding is a problem of representing a collection of 𝑁 𝑁 vectors in 𝑑 𝑑 -dimensional space as linear combination

machine learning - Sparse coding vs. sparse PCA, are they the same thing? - Cross Validated Stack Internal Knowledge at work Bring the best of human thought and AI automation together at your work. Explore Stack Internal Sparse coding vs. sparse PCA, are they the same thing? Ask Question Asked 11 years, 7 months ago Modified 5 years, 6 months ago Viewed 3k times 3 $\begingroup$ Are they the same thing? If not, could someone possibly explain the difference or point to the seminal papers describing the approaches? I am looking not for a detailed technical exposition, but a general taxonomy of th

related reading