Explores Principal Component Analysis for dimensionality reduction in machine learning, showcasing its feature extraction and data preprocessing capabilities.
Covers Principal Component Analysis for dimensionality reduction, exploring its applications, limitations, and importance of choosing the right components.
Covers the k-Nearest-Neighbor classifier, hand-written digit recognition, multi-class k-NN, data reduction, applications, graph construction, limitations, and the curse of dimensionality.
Covers the Nearest Neighbor search algorithm and the Johnson-Lindenstrauss lemma for dimensionality reduction, exploring preprocessing techniques and locality-sensitive hashing.
Covers PCA and LDA for dimensionality reduction, explaining variance maximization, eigenvector problems, and the benefits of Kernel PCA for nonlinear data.