Lecture 8: Unsupervised Learning II

Content locked

The catalog is public. Reading this content requires approved access.

Introduction

Graph-Based Clustering

Graph Cuts

Normalized Cut

Spectral Clustering

Algorithm Steps

Example: Computing Laplacian

Spectral Clustering vs PCA

Advantages of Spectral Clustering

Visualization with t-SNE

t-SNE Algorithm

t-SNE Properties

t-SNE vs PCA

Dimensionality Reduction Examples

MNIST Dataset

Other t-SNE Examples

Density Estimation

Histograms

Kernel Density Estimation

Practice Problems

Key Takeaways