HumachLearnLearn · explore · apply
Start learning
Unsupervised LearningLinear Dimensionality ReductionDimensionality Reduction

Principal Component Analysis (PCA)

Primary task · Dimensionality Reduction

Principal Component Analysis (PCA) is an unsupervised learning method in the linear dimensionality reduction family. This page summarizes its mechanism, practical uses, important trade-offs, and a browser-based concept explorer.

← Directory
Visual intuition

From data to learned behaviour

Principal Component Analysis (PCA) converts patterns in observed data into a reusable prediction or representation rule. The most useful way to understand it is to watch what internal structure changes during training and how that learned structure changes outputs.

Infographic
1Data2Initial state3Optimise4Validate5InferenceTraining transforms evidence into a reusable model state
Conceptual simulation

Watch the learning mechanism form

The structure below is synchronized with the same training state used by the prediction simulation.

Mechanism view
Training control centre

Control both simulations together

Reset regenerates the synthetic data and model state. Train animates to completion. Pause freezes the animation. Train Step advances one learning stage.

Step 0 / 12
Model simulation

Inspect the learned prediction / representation

Synthetic data are generated locally in your browser.

Model description

Understand Principal Component Analysis (PCA) after watching it learn

This section connects the animation to the actual statistical or computational idea behind the model.

Deep description

Principal Component Analysis (PCA) Principal Component Analysis (PCA) is an unsupervised learning method in the linear dimensionality reduction family. This page summarizes its mechanism, practical uses, important trade-offs, and a browser-based concept explorer.

What is learned. During training, the algorithm builds or adjusts the parameters and internal representation used by Principal Component Analysis (PCA). The core learning mechanism is: Calculates orthogonal eigenvectors of the data covariance matrix to project features onto principal components that maximize explained variance.

How training becomes inference. Prepare data → initialise the model state → evaluate the current objective → update parameters or structure → validate progress → use the final state for inference. Once training stops, the fitted state is reused on unseen inputs rather than being reconstructed from scratch. The resulting output is: A lower-dimensional embedding or transformed representation designed to preserve selected structure.

Why practitioners use it. Unsupervised, deterministic, mathematically optimal variance preservation, removes collinearity. Typical fits include Data preprocessing, noise filtration, financial risk factor models (eigen-portfolios), 2D/3D visualization.

What to verify before trusting it. Cannot capture non-linear relationships; principal components are linear combinations that can be hard to interpret. The visual simulation is intentionally simplified, so real use should still validate preprocessing, data independence, hyperparameters, uncertainty and task-appropriate metrics.

Internal statethe parameters and internal representation used by Principal Component Analysis (PCA)
Typical outputA lower-dimensional embedding or transformed representation designed to preserve selected structure.
Good fitData preprocessing, noise filtration, financial risk factor models (eigen-portfolios), 2D/3D visualization.
Main cautionCannot capture non-linear relationships; principal components are linear combinations that can be hard to interpret.
1Training data→
2Learning objective→
3Internal model state→
4Prediction / representation→
5Evaluation
Intuition

What the model is trying to learn

Principal Component Analysis (PCA) converts patterns in observed data into a reusable prediction or representation rule. The most useful way to understand it is to watch what internal structure changes during training and how that learned structure changes outputs.

Mathematical lens

Core logic

Calculates orthogonal eigenvectors of the data covariance matrix to project features onto principal components that maximize explained variance. The mathematical objective determines which model states are considered better, while regularisation and validation constrain how much complexity should be trusted.

Training sequence

How learning progresses

Prepare data → initialise the model state → evaluate the current objective → update parameters or structure → validate progress → use the final state for inference.

Original mechanism

Taxonomy description

Calculates orthogonal eigenvectors of the data covariance matrix to project features onto principal components that maximize explained variance.

Evaluation guide

How to evaluate this model responsibly

ValidationChoose validation that matches the independence assumptions of the data.
MetricsUse task-specific primary and complementary metrics.
HPOEstablish a baseline first, then search the parameters that materially change capacity.
Post-processingValidate any downstream transformation on held-out data.
Cross-Validation & Data SplittingHyperparameter OptimisationData PreprocessingExplainability & Model InterpretationPrediction Post-Processing
Hyperparameters

Key parameters

n_componentsTypical: 2 / variance ratio

Number of retained components or variance fraction.

svd_solverTypical: auto

SVD implementation.

whitenTypical: False

Rescales projected components to unit variance.

Use & trade-offs

Where it fits

Typical applications

Data preprocessing, noise filtration, financial risk factor models (eigen-portfolios), 2D/3D visualization.

Strengths

Unsupervised, deterministic, mathematically optimal variance preservation, removes collinearity.

Limitations

Cannot capture non-linear relationships; principal components are linear combinations that can be hard to interpret.

Code example

Minimal Python implementation

# Purpose: demonstrate Principal Component Analysis (PCA) with a small, inspectable example.
# Follow the comments and printed stages to connect each operation with its result.
# Minimal dimensionality-reduction starter for Principal Component Analysis (PCA)
# Import the library or helper used in this example.
from sklearn.datasets import load_iris
# Import the library or helper used in this example.
from sklearn.decomposition import PCA

# Print this intermediate result so you can verify the workflow step by step.
print("STEP 1 · Prepare the miniature example")
# Store this intermediate value with a descriptive name for the next step.
X, _ = load_iris(return_X_y=True)
# Learn the transformation from this data and apply it in one step.
Z = PCA(n_components=2).fit_transform(X)
# Print this intermediate result so you can verify the workflow step by step.
print("STEP 3 · Inspect predictions / metrics")
# Print this intermediate result so you can verify the workflow step by step.
print(Z.shape)
Expected / representative output
STEP 1 · Prepare the miniature example
STEP 3 · Inspect predictions / metrics
(150, 2)