Starting from PCA and MDS, we explain the mathematical ideas behind classical and modern dimension reduction embeddings including ISOMAP, LLE, LE, HLLE, DM, etc.
The course introduces various machine learning algorithms and focuses on how to write these algorithms from scratch.
In the course we will investigate the beautiful relations between matrices and graphs. Possible topics include, but not limited to, adjacency matrix and random walk, Laplacian matrix and graph partition, König graph and Cayley–Hamilton theorem.
All courses are taught in Department of Applied Mathematics, National Sun Yat-sen University.