MNIST Classification LDA SVM CART & Generalized Eigenvalue Problems

In this UW assignment report we analyze the MNIST handwritten digit dataset. We start with Principal Component Analysis (PCA) for dimensionality reduction and visualization. Visualization of the digits is accomplished by projection on 3 principal components such that each image is represented by a single 3D point. We next build a few supervised classifiers and compare their accuracy. Classification methods explored in this report include Linear Discriminant Analysis (LDA), Support Vector Machine (SVM) and Classification And Regression Tree (CART) used in the classification mode.

Read a detailed explanation of MNIST classification with LDA, SVM & CART in terms of eigenvalue problems here.

The Github project is availabe here: https://github.com/aruymgaart/AMATH/tree/master/MNIST_classifier_LDA_SVM_CART_582HW4.

Python implementation of DMD:

Comments

Popular posts from this blog

Data science & ML Video Tutorials Part II - Group & Set Theory (Groups, Rings & Fields)

Finite Difference Simulation of a Helmholtz Resonator - 2D Acoustic Wave Equation

Combination Finite Difference & Spectral Solution to Advection-Diffusion PDE