Spectral Clustering: Finding Clusters

Related lectures (28)

Page 2 of 3

Introduces unsupervised learning through clustering with K-means and dimensionality reduction using PCA, along with practical examples.

On PCA includes interactive exercises and emphasizes minimizing information loss.

Explores spectral decomposition of symmetric matrices and Singular Value Decomposition (SVD) for matrix decomposition.

Explores the Jordan normal form and its applications in linear algebra, focusing on diagonalization and cyclic bases.

Covers the diagonalization of symmetric matrices, the spectral theorem, and the use of spectral decomposition.

Covers the decomposition of symmetric matrices into eigenvalues and eigenvectors.

Explores the application of matrices and eigendecompositions in networks.

Covers phase portraits, eigenvalue decomposition, Jordan decomposition, and stable nodes in non-linear systems.

Delves into singular value decomposition and its applications in linear algebra.

Covers Canonical Correlation Analysis, a method to find relationships between two sets of variables.