Principal component analysis
Linear technique that identifies directions of maximum variance in data.
Principal component analysis (PCA) is a linear method for reducing the number of dimensions in a dataset, commonly used for exploring data, creating visualizations, and preprocessing. It works by reorienting the data into a new coordinate system where the axes—called principal components—are aligned with the directions of greatest variation. The first principal component is a unit vector that defines the line that best fits the data, minimizing the average squared perpendicular distance from each point to that line. Each subsequent component is a unit vector orthogonal to all previous ones, capturing the next largest amount of remaining variation. Together, these components form an orthonormal basis, and the data’s dimensions become linearly uncorrelated in this new space. Researchers often plot data using just the first two principal components to visually identify clusters of similar points. PCA is applied in fields like population genetics, microbiome research, and atmospheric science.
In practice, the first principal component is a linear combination of the original variables that explains the most variance. The second explains the most variance in the residuals after removing the first component’s effect, and this process continues until all variance is accounted for. PCA is especially useful when many original variables are highly correlated, allowing them to be reduced to a smaller, independent set. Equivalently, each principal component can be seen as a direction that maximizes the variance of the projected data, with later components constrained to be orthogonal to earlier ones. These principal components are the eigenvectors of the data’s covariance matrix, so they are typically computed via eigendecomposition of that matrix or singular value decomposition of the data matrix. PCA is the simplest eigenvector-based multivariate analysis and is closely related to factor analysis, though factor analysis incorporates more domain-specific assumptions and solves eigenvectors of a slightly different matrix. It also relates to canonical correlation analysis (CCA), which finds coordinate systems that describe cross-covariance between two datasets, whereas PCA describes variance in a single dataset. Robust and L1-norm-based variants of PCA exist.
PCA was first introduced by Karl Pearson in 1901 as an analogue of the principal axis theorem in mechanics, and later independently developed and named by Harold Hotelling in the 1930s. Depending on the field, it is also called the discrete Karhunen–Loève transform (KLT) in signal processing, the Hotelling transform in multivariate quality control, proper orthogonal decomposition (POD) in mechanical engineering, singular value decomposition (SVD) of the data matrix, eigenvalue decomposition (EVD) of XᵀX in linear algebra, factor analysis (with noted differences), the Eckart–Young theorem, empirical orthogonal functions (EOF) in meteorology, empirical eigenfunction decomposition, quasiharmonic modes, spectral decomposition in noise and vibration, and empirical modal analysis in structural dynamics.
Conceptually, PCA can be thought of as fitting a p-dimensional ellipsoid to the data, where each axis of the ellipsoid corresponds to a principal component. If an axis is small, the variance along that direction is also small. To find these axes, each variable’s values are first centered at zero by subtracting their mean. Then the covariance matrix of the centered data is computed, and its eigenvalues and eigenvectors are calculated. The orthogonal eigenvectors are normalized to unit vectors, and each becomes an axis of the fitted ellipsoid. This basis diagonalizes the covariance matrix, so the diagonal elements give the variance along each axis. The proportion of total variance explained by an eigenvector equals its eigenvalue divided by the sum of all eigenvalues. Biplots and scree plots are used to interpret the results. PCA is an orthogonal linear transformation on a real inner product space that converts the data to a new coordinate system.
- field
- Statistics, data analysis, signal processing
- known_for
- Dimensionality reduction via orthogonal transformation to principal components
- related_methods
- Factor analysis, canonical correlation analysis, singular value decomposition
- alternative_names
- Karhunen–Loève transform, Hotelling transform, proper orthogonal decomposition, empirical orthogonal functions
Lore & Background
Principal component analysis (PCA) is a linear technique for reducing the dimensionality of data, commonly used in exploratory analysis, visualization, and preprocessing. It works by transforming the original variables into a new coordinate system where the axes, called principal components, are aligned with the directions of greatest variance in the data. The first principal component is the linear combination of the original variables that captures the most variance; each subsequent component is orthogonal to the previous ones and captures the maximum remaining variance. These components form an orthonormal basis, meaning the transformed dimensions are linearly uncorrelated. The principal components are mathematically derived as the eigenvectors of the data’s covariance matrix, typically computed via eigendecomposition or singular value decomposition. PCA can be visualized as fitting a p-dimensional ellipsoid to the data, where each axis corresponds to a principal component. The variance explained by each component is proportional to its eigenvalue. In practice, the first two components are often used to plot data in two dimensions, helping to identify clusters. PCA is the simplest eigenvector-based multivariate analysis and is related to factor analysis and canonical correlation analysis, though it differs in its focus on variance within a single dataset. Robust and L1-norm variants exist. Interpretations are aided by biplots and scree plots, which show the proportion of explained variance.
Reader's Guide
Principal component analysis is a foundational technique for reducing the dimensionality of datasets while preserving as much variance as possible. It works by finding a sequence of orthogonal unit vectors—the principal components—that best fit the data by minimizing the average squared perpendicular distance from points to each line. The first principal component explains the most variance, and each subsequent component explains the most variance orthogonal to the previous ones. Computationally, principal components are eigenvectors of the data's covariance matrix, often obtained via eigendecomposition or singular value decomposition. PCA is widely used in fields such as population genetics, microbiome studies, and atmospheric science. It is the simplest eigenvector-based multivariate analysis and is closely related to factor analysis and canonical correlation analysis. Many studies use the first two principal components to plot data in two dimensions and visually identify clusters. Biplots and scree plots are used to interpret PCA findings.
Did You Know?
- The first principal component maximizes the variance of the projected data.
- Principal components are eigenvectors of the data's covariance matrix.
- PCA is also known as the discrete Karhunen–Loève transform in signal processing.
The Variance-Chasing Engine
Principal component analysis operates as a linear dimensionality reduction technique that reorients an entire dataset onto a fresh coordinate system. At its heart, the method constructs a sequence of unit vectors, each one representing the direction of a line that best fits the data while remaining strictly orthogonal to every vector that came before it. Best fit here carries a precise meaning: the chosen direction minimizes the average squared perpendicular distance from all data points to that line. The first component captures the greatest possible variance among all linear combinations of the original variables, and each subsequent component extracts the most remaining variance after the preceding components have been accounted for. Mathematically, these directions turn out to be the eigenvectors of the data's covariance matrix, which means practitioners typically compute them through eigendecomposition of that covariance matrix or, equivalently, singular value decomposition of the raw data matrix. The resulting set of mutually orthogonal vectors forms an orthonormal basis in which the individual dimensions of the data become linearly uncorrelated, and PCA stands as the simplest member of the eigenvector-based multivariate analysis family.
One Method, a Dozen Names
Few statistical tools have accumulated as many aliases as principal component analysis. Karl Pearson first introduced the technique in 1901, framing it as a statistical analogue of the principal axis theorem from mechanics. Decades later, Harold Hotelling independently developed and gave the method its now-familiar name in the 1930s. Yet across the scientific landscape, the same mathematical operation wears a different hat in nearly every discipline. Signal-processing engineers call it the discrete Karhunen–Loève transform, while quality-control specialists refer to it as the Hotelling transform. Mechanical engineers know it as proper orthogonal decomposition, and meteorologists working with atmospheric data invoke empirical orthogonal functions, a term popularized by Lorenz in 1956. In linear algebra it surfaces as the singular value decomposition of a data matrix, a technique itself dating to the last quarter of the nineteenth century, or as the eigenvalue decomposition of the matrix X transpose times X. Researchers in noise and vibration call it spectral decomposition, structural-dynamics specialists use empirical modal analysis, and others have labeled it quasiharmonic modes or empirical eigenfunction decomposition. Even the Eckart–Young theorem points back to the same underlying eigenvector machinery.
The Ellipsoid Intuition
Rather than viewing PCA as an abstract algebraic procedure, one can picture it as fitting a p-dimensional ellipsoid around a cloud of data points. Each axis of that ellipsoid corresponds to one principal component, and the length of an axis directly reflects how much variance the data exhibit along that direction; a short axis signals little spread, a long one signals a great deal. To locate those axes in practice, the analyst first centers every variable by subtracting its observed mean from each value, so that all columns of the data matrix carry a zero empirical mean. The next step is to compute the covariance matrix of these centered values and then extract its eigenvalues and eigenvectors. After normalizing each orthogonal eigenvector into a unit vector, the collection of mutually perpendicular unit vectors defines the ellipsoid's axes. In this new basis the covariance matrix becomes diagonal, with the diagonal entries giving the variance along each axis. The fraction of total variance captured by any one component is simply its eigenvalue divided by the sum of all eigenvalues. Biplots and scree plots then provide visual summaries that help researchers interpret which components matter most.
From Genetics to the Atmosphere
Although PCA was born as a general-purpose linear algebra tool, its reach extends far beyond pure mathematics. In population genetics, microbiome research, and atmospheric science, analysts routinely apply the method to distill complex, high-dimensional measurements into a handful of interpretable axes. The technique is especially valuable when many of the original variables are highly correlated with one another, because PCA condenses them into an independent set that preserves the dominant patterns of variation. A common practical use is to take just the first two principal components and project the data onto a two-dimensional plane, making it possible to visually spot clusters of closely related observations. PCA also sits in a family of related multivariate methods: factor analysis, which layers additional domain-specific assumptions about underlying structure and solves eigenvectors of a slightly different matrix; canonical correlation analysis, which optimally describes cross-covariance between two separate datasets rather than variance within a single one; and robust or L1-norm-based variants that have been proposed to handle atypical observations more gracefully. In every case, the shared thread is the extraction of eigenvectors from a covariance-like structure.
Gallery






Frequently Asked Questions
Who is Principal component analysis?
PCA is a linear dimensionality-reduction method that reorients a dataset onto a fresh set of axes so the most informative directions surface first. It sits at the heart of exploratory data analysis, visualization, and preprocessing pipelines across statistics, signal processing, and many applied sciences.
What are Principal component analysis's powers/role?
Its signature move is identifying orthogonal directions of maximum variance and projecting the data onto them, compressing many variables into a smaller set of components. The transformation is linear and closely tied to singular value decomposition, ensuring the leading components preserve as much total spread as possible.
How does Principal component analysis's story end?
The procedure wraps up with a ranked list of principal components, each accounting for a decreasing share of the original variance. Analysts then hand that lower-dimensional summary to visualization, classification, or downstream modeling steps.
Why is Principal component analysis important?
It offers a model-free, interpretable way to distill high-dimensional data into its dominant patterns without assuming any particular generative process. That simplicity and broad applicability make it a foundational tool in fields ranging from genomics and image compression to finance and climate science.
What are Principal component analysis's alternate names?
Depending on the discipline, the same technique appears as the Karhunen–Loève transform, the Hotelling transform, proper orthogonal decomposition, or empirical orthogonal functions. These aliases reflect its independent rediscovery in signal processing, multivariate statistics, and fluid dynamics.
More in Probability & Statistics 1-24
Spotted an error? Know more?
This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record
