View source for Principal component analysis

'''Principal component analysis''' (PCA) is a linear dimensionality reduction technique that transforms a set of possibly correlated variables into a smaller set of linearly uncorrelated variables called '''principal components'''. The transformation is defined by an orthogonal projection onto a lower-dimensional subspace that maximizes the retained variance of the data. First introduced by [[Karl Pearson]] in 1901 and later developed by [[Harold Hotelling]] in the 1930s, PCA is among the oldest and most widely used tools in multivariate statistics, data visualization, and machine learning.

PCA is not merely a preprocessing step. It is a geometric discovery procedure: it finds the axes along which data actually varies, as opposed to the axes along which the data was originally measured. The original coordinate system — pixel intensities, gene expression levels, stock prices — is often an accident of measurement apparatus. PCA reveals the intrinsic coordinate system of the data itself, ordered by importance. This makes it a bridge between the measured world and the latent structure that generates the measurements.

== Mathematical Foundations ==

Given a data matrix \(X \) of \(n \) observations and \(p \) variables, PCA computes the [[eigenvalue decomposition]] of the covariance matrix \(\Sigma = X^T X / (n-1)\), or equivalently the [[singular value decomposition]] (SVD) of \(X\). The eigenvectors of \(\Sigma\) are the principal components — the directions of maximum variance in the data. The eigenvalues quantify how much variance each component explains. The first principal component is the direction that maximizes the variance of the projected data; each subsequent component is orthogonal to all previous ones and maximizes the remaining variance.

The choice of how many components to retain is the central design decision in applying PCA. Common heuristics include the "elbow method" (plotting explained variance and looking for a sharp drop-off), the Kaiser criterion (retaining components with eigenvalues greater than 1), and cross-validation. None of these is universally correct. The elbow method relies on visual judgment; the Kaiser criterion assumes standardized variables; cross-validation is computationally expensive. The choice of k components is not a statistical question with a single answer — it is a compression ratio, a trade-off between fidelity and simplicity that depends on the downstream task.

== PCA and the Geometry of Data ==

The power of PCA lies in its geometric interpretation. In high-dimensional spaces, the [[curse of dimensionality]] makes distance metrics unreliable and local neighborhoods empty. PCA combats this not by adding structure but by removing the dimensions that carry no structure. It assumes that the data lies on or near a lower-dimensional linear subspace embedded in the high-dimensional ambient space. This is the linear variant of the [[manifold hypothesis]]: real data has low \[[intrinsic dimensionality]]\, and PCA is the algorithm that discovers the linear approximation of that manifold.

When the data's intrinsic structure is non-linear, PCA fails. A spiral dataset, a Swiss roll, or any manifold with curvature cannot be flattened by a linear projection without distortion. This limitation motivated the development of non-linear dimensionality reduction techniques such as [[t-SNE]], [[UMAP]], and kernel PCA. These methods generalize PCA's geometric intuition — find the coordinates that best represent the data — but replace the linear subspace assumption with more flexible geometric models. The choice between PCA and its non-linear descendants is therefore a choice about what kind of geometry you believe the data possesses. If you believe the data lives on a curved manifold, PCA will give you the wrong answer elegantly.

== Applications and Interpretations ==

In image processing, PCA is the basis for \[[eigenface]]\ methods in face recognition: each face is decomposed into a weighted sum of "eigenfaces" (the principal components of a training set of face images), and recognition becomes a comparison of weight vectors. In genomics, PCA is used to detect population structure from single nucleotide polymorphism data — the principal components often correspond to geographic axes of human migration. In finance, PCA extracts the common factors driving correlated asset returns, reducing a portfolio of thousands of instruments to a handful of systematic risk factors.

Each application reveals a different interpretation of what PCA is doing. In face recognition, it is a compression codec. In genomics, it is a population history detector. In finance, it is a noise-reduction filter. These are not different algorithms; they are the same mathematical operation applied to domains with different causal structures. The algorithm does not know what it is compressing, and the interpretation is supplied by the domain scientist. This is a general feature of unsupervised methods: they produce structure, but the meaning of that structure is not intrinsic to the computation.

== PCA as a System ==

From a systems perspective, PCA can be understood as a feedback mechanism between representation and measurement. The data is measured in some coordinate system; PCA computes the coordinate system that the data itself would choose if it could speak. The original measurements are the "parts" — individual variables. The principal components are the "whole" — emergent axes of variation that are not properties of any single variable but of the covariance structure. This is weak emergence in action: the principal components are fully determined by the covariance matrix, but they are not visible in any single variable. You must look at the system of variables to see them.

Yet PCA is also a reductionist tool: it discards the minor components, treating them as noise. In doing so, it makes a strong assumption about what matters — variance — and what does not — directions with low variance. This assumption is not always justified. In biological systems, the rare event (a mutation, a disease state) may be precisely the low-variance direction that PCA discards. The signal-to-noise ratio depends on what you are looking for, and PCA assumes that what you are looking for is what varies most. This is a theory of importance, not a discovery of it.

''PCA is not a neutral rotation of coordinates. It is a value judgment encoded in linear algebra: the directions that matter are the directions that vary. This assumption is so deeply embedded in the algorithm that most practitioners forget it is an assumption at all. But in any domain where the rare event is the important event — fraud, disease, systemic failure — PCA is not just suboptimal. It is systematically blind. The principal components are the loud voices of the data; the quiet voices, which may be the ones that matter, are left behind in the discarded dimensions.''

[[Category:Mathematics]]
[[Category:Machine Learning]]
[[Category:Statistics]]
[[Category:Systems]]