Principal Component Analysis is the workhorse of dimensionality reduction, creating a compact set of uncorrelated summary variables that capture as much of the original data's variance as possible. PCA exists because high-dimensional data is costly to model, harder to visualise, and plagued by the curse of dimensionality where distances become meaningless, and because many datasets have highly correlated features that contain redundant information that PCA condenses. Rather than selecting a subset of original features, PCA creates new composite features — principal components — that are linear combinations of the originals, each capturing a progressively smaller slice of the total variance. Understanding PCA means understanding both its power, compressing many correlated features into a few informative dimensions, and its cost, trading interpretability for compression, since the new components are abstract combinations rather than named variables.
30 minintermediate
PCA — Principal Component Analysis
Analogy🏏Cricket
🏏 Think of it like cricket: Reducing twenty batting statistics to two dimensions with PCA produces a flat projection that may look like one undifferentiated cloud, while t-SNE or UMAP finds that the data actually organises into distinct clusters — aggressive pinch-hitters, steady anchors, explosive finishers — whose separation PCA's flat projection smeared together. Just as the non-linear reduction reveals the natural groupings that flat projection could not, t-SNE and UMAP reveal structure that PCA misses because it can only flatten, not curve to follow the data's natural shape. The insight is that non-linear reduction methods follow the data's true curved geometry rather than forcing a flat projection, revealing the cluster structure and local neighbourhoods that linear methods like PCA cannot preserve.
Lesson 22 of 35
0% complete