Dimensionality Reduction: Rank-k Approximation and Eigen-decomposition - Lecture 20
You’re only 3 weeks away from a new language
2,000+ Free Courses with Certificates: Coding, AI, SQL, and More
Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
Learn advanced dimensionality reduction techniques in this university lecture covering rank-k approximation methods, their connection to eigendecomposition, and the power method algorithm for finding dominant eigenvalues and eigenvectors in large matrices.
Syllabus
FoDA F22 Lecture 20
Taught by
UofU Data Science