Aman's AI Journal • CS229 • Principal Component Analysis
We will shortly develop the PCA algorithm. But prior to running PCA per se, typically we first pre-process the data to normalize its mean and variance, as follows: If you found our work useful, please cite it as:
Overview Remarks References Citation Overview In our discussion of factor analysis, we gave a way to model data \(x \in \mathbb{R}^{n}\) as “approximately” lying in some \(k\)-dimensional subspace, where \(k \ll n\). Specifically, we imagined that each point \(x^{(i)}\) was created by first generating some \(z^{(i)}\) lying in the \(k\)-dimensional affine space \(\left\{\Lambda z+\mu ; z \in \mathbb{R}^{k}\right\}\), and then adding \(\Psi\)-covariance noise. Factor analysis is based on a probabilistic model, and parameter estimation used the iterative EM algorithm. In this section, we will de
saved by
related reading
- Principal component analysis - Wikipediaen.wikipedia.org
- dimensionality reduction - Relationship between SVD and PCA. How to use SVD to perform PCA? - Cross Validatedstats.stackexchange.com
- Principal Component Analysis (PCA): Explained Step-by-Step | Built Inbuiltin.com
- Principal Component Analysis (PCA) | Towards Data Sciencetowardsdatascience.com
- unsupervised learning and PCApeople.eecs.berkeley.edu
- Singular value decomposition - Wikipediaen.wikipedia.org
- MathofSNLnotes2025.pdfpeople.math.ethz.ch
- https://www.deeplearningbook.org/contents/linear_algebra.htmldeeplearningbook.org
- Sparse PCA - Wikipediaen.wikipedia.org
- [1904.01277] A PCA-like Autoencoderarxiv.org
- Dimensionality reduction in neural data analysisxcorr.net
- pca - What is the intuition behind SVD? - Cross Validatedstats.stackexchange.com