Statistical Decision Theory and Bayesian Learning · Machine Learning

Principal Component Analysis

Watch lectures

Principal Component Analysis

1. Goal

Compress Rd→RkR^{d} → R^{k} (k<dk < d) keeping maximum variance. Denoises, visualizes, speeds later models.

2. Steps

1. center X (subtract mean)
2. covariance C = (1/n) X^{T} X
3. eigen-decompose C → eigenvalues λ₁ ≥ λ₂ ...
4. keep top-k eigenvectors V_{k}
5. project Z = X V_{k}

Variance kept by top-kk:

λ1+...+λkλ1+...+λd\frac{λ₁ + ... + λ_{k}}{λ₁ + ... + λ_{d}}

3. Worked

2-D elongated cloud: λ1λ₁ large (long axis), λ2λ₂ small. Keep k=1k=1 → points on line, 95% variance kept. Choose kk for 90-99% variance.

4. Properties

  • Components uncorrelated, ordered by variance.
  • Sensitive to scale → standardize first.
  • Linear only (kernel PCA for curves).

5. Exam Points

  • PCA steps + variance ratio — 7 marks, very frequent.
  • Eigen of covariance role — 3-5 marks, frequent.
  • Why center / standardize — 3 marks, frequent.
Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

← All Machine Learning modules