Accès direct au contenu

MATH

Version anglaise

aide

Unsupervised learning: from big data to low-dimensional representations

Lecturer:  René VIDAL  Center for Imaging Science Department of Biomedical Engineering Johns Hopkins University


Course Description:

In the era of data deluge, the development of methods for discovering structure in high-dimensional data is becoming increasingly important. This course will cover state-of-the-art methods from algebraic geometry, sparse and low-rank representations, and statistical learning for modeling and clustering high-dimensional data. The first part of the course will cover methods for modeling data with a single low-dimensional subspace, such as PCA, Robust PCA, Kernel PCA, and manifold learning techniques. The second part of the course will cover methods for modeling data with multiple subspaces, such as algebraic, statistical, sparse and low-rank subspace clustering techniques. The third part of the course will cover applications of these methods in image processing, computer vision, and biomedical imaging.

Organization of the course:


Week of Oct 2
- Introduction - Principal Component Analysis: Statistical View - Principal Component Analysis: Geometric View - Rank Minimization View of PCA - Applications in Face Recognition

Week of Oct 9
- PCA with Missing Entries via Convex Optimization - PCA with Corrupted Entries via Convex Optimization

Week of Oct 16
- PCA with Outliers via Convex Optimization - Applications in Robust Face Recognition

Week of Oct 30
- Sparse Subspace Clustering - Sparse Subspace Clustering

Week of Nov 6
- Low Rank Subspace Clustering - Applications in Face Clustering