x
Menu

Unsupervised Learning: From Big Data to Low-Dimensional Representations

Johns Hopkins University,, Fall 2017 , Prof. René Vidal

Updated On 02 Feb, 19

Overview

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.

Includes

Lecture 1: Lecture 1 | Syllabus + Introduction + Basics of Linear Algebra (Hopkins)

4.1 ( 11 )


Lecture Details

Unsupervised Learning: Spring 2017 at Johns Hopkins University.
Professor Rene Vidal.

Ratings

0


0 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send