PCA 2D/3D Visualizer

Principal Component Analysis strictly reframes high-dimensional data by algorithmically isolating the precise orthogonal eigenvectors of the covariance matrix. This linear dimensionality reduction fundamentally preserves maximal variance while aggressively shedding superfluous stochastic noise, establishing the foundation of unsupervised machine learning.

PCA hunts for the single line your cloud of points stretches along most, then measures where each point sits on it. The explained-variance percentage tells you how much of the spread that one line keeps. Here, once PC1 climbs past about 85%, the tool announces that a flat 1D summary loses almost nothing. Switch between the sample sets to watch a tightly correlated cloud hand nearly all its variance to PC1.

It is tempting to read PC1 as the ordinary line of best fit, but the two optimize different things: linear regression minimizes the vertical distances (along the y axis) to the line, while PCA minimizes the perpendicular distances to it. On the same points, the two lines genuinely diverge. Karl Pearson published exactly this perpendicular line of closest fit back in 1901, three decades before the term principal component was coined.