Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Principal Component Analysis Algorithm

Machine Learning Algorithm

Principal component analysis reduces the dimensionality of a dataset by computing a new set of axes, the principal components, ordered so the first captures the greatest possible variance in the data, the second the greatest remaining variance orthogonal to the first, and so on, typically found by computing the eigenvectors and eigenvalues of the data's covariance matrix. Projecting the data onto the first few principal components lets a smaller number of dimensions represent most of the dataset's variation, useful for visualization, noise reduction and speeding up other algorithms. Karl Pearson described the underlying idea in 1901, and Harold Hotelling developed the modern statistical formulation in the 1930s.

Facts
Time Complexity
Time Complexity (category)
Cubic Time -- O(n^3) 1
Credited To
Karl Pearson; Harold Hotelling 2
Sources
1. Principal Component Analysis Algorithm (Wikipedia)
Wikipedia infobox: time complexity cubic
Quote, Wikipedia infobox: time complexity cubic
cubic
View the Source
2. Wikipedia: Principal component analysis
History
Quote, History
PCA was invented in 1901 by Karl Pearson, as an analogue of the principal axis theorem in mechanics; it was later independently developed and named by Harold Hotelling in the 1930s.
View the Source
scikit-learn: scikit-learn: Decomposing signals in components
scikit-learnIn Group: Dimensionality Reduction and Matrix Factorization Algorithms, Section 2.5.1 PCA
Quote, In Group: Dimensionality Reduction and Matrix Factorization Algorithms, Section 2.5.1 PCA
PCA is used to decompose a multivariate dataset in a set of successive orthogonal components that explain a maximum amount of the variance.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.