Foundations · Common Data Science & ML Tasks

Dimensionality reduction

Dimensionality reduction maps many input variables into a smaller representation while preserving selected structure. The important practical question is not only how the technique is defined, but what assumptions it introduces, which data are allowed to influence it, and how its effect should be validated on unseen evidence.

Reference lessonPython exampleVisual explanation

Intuition first

What this concept means in practice

The practical value of Dimensionality reduction comes from understanding both the transformation and the boundary around it: what information is allowed to enter, what assumption is being made, and how you know the result is still valid after the transformation.

A beginner-friendly way to reason about it is to start with a tiny case where the correct result can be checked independently. Once the mechanism is clear, scale the exact same reasoning to larger tables, pipelines or models.

PurposeUse for compression, visualisation, denoising and representation learning.

MechanismOptimise variance, neighbourhood relationships, reconstruction or a learned latent representation.

EvidenceInspect intermediate and final output; compare with an independent expectation.

Main cautionLow-dimensional plots can distort global or local relationships depending on the method.

Mechanism

Trace the operation from input to decision

Optimise variance, neighbourhood relationships, reconstruction or a learned latent representation.

1Input→

2Apply rule→

3Inspect state→

4Validate→

5Use result

Key rule

X ∈ ℝⁿˣᵖ → Z ∈ ℝⁿˣᵈ, d < p

Visual explanation

Make the structure visible

The interactive view uses a concept-specific plot when the topic maps naturally to one; otherwise it uses a workflow view instead of leaving a broken placeholder.

Loading visual…

Practical example

Where you would use it

Project hundreds of correlated measurements into a compact embedding for visualisation or modelling.

Use when

Use for compression, visualisation, denoising and representation learning.

Pitfall

What can make the result misleading

Watch out

Low-dimensional plots can distort global or local relationships depending on the method.

A useful diagnostic question is: Could the same code still run successfully if the analytical assumption were wrong? If yes, add an explicit validation check rather than relying on execution success.

Implementation

Miniature Python example

Keep the example small enough that you can inspect each stage manually.

Python

# Purpose: demonstrate Dimensionality reduction with a small, inspectable example.
# Follow the comments and printed stages to connect each operation with its result.
# Import the library or helper used in this example.
# Step 1 — Import the module so its functions/classes are available to the rest of this example.
import numpy as np
# Import the library or helper used in this example.
# Step 2 — Import only the named objects needed by the following steps, keeping dependencies explicit.
from sklearn.preprocessing import StandardScaler
# Import the library or helper used in this example.
# Step 3 — Import only the named objects needed by the following steps, keeping dependencies explicit.
from sklearn.decomposition import PCA

# Create the numerical values used in the calculation.
# Step 4 — Construct `X` as an array so vectorised numerical operations can be applied consistently.
X = np.array([[2.5,2.4,1.2],[0.5,0.7,0.2],[2.2,2.9,1.4],[1.9,2.2,1.0],[3.1,3.0,1.6],[2.3,2.7,1.3],[2.0,1.6,.8],[1.0,1.1,.5],[1.5,1.6,.7],[1.1,.9,.4],[3.0,3.2,1.7],[.8,1.0,.3]])
# Print this intermediate result so you can verify the workflow step by step.
# Step 5 — Display the current value explicitly so the result/state can be inspected during execution.
print("STEP 1 · Original shape:", X.shape)
# Learn the transformation from this data and apply it in one step.
# Step 6 — Fit the transformation on the training input and immediately transform that same input.
Xs = StandardScaler().fit_transform(X)
# Fit only on the training data so the model learns from allowed information.
# Step 7 — Fit the model or transformer, learning its parameters from the supplied training data.
pca=PCA(n_components=2).fit(Xs)
# Apply the already-learned transformation without refitting it.
# Step 8 — Apply the already-fitted transformation without relearning its parameters from this data.
Z=pca.transform(Xs)
# Print this intermediate result so you can verify the workflow step by step.
# Step 9 — Display the current value explicitly so the result/state can be inspected during execution.
print("STEP 2 · Explained variance:", pca.explained_variance_ratio_.round(3).tolist())
# Print this intermediate result so you can verify the workflow step by step.
# Step 10 — Display the current value explicitly so the result/state can be inspected during execution.
print("STEP 3 · Reduced shape:", Z.shape)
# Print this intermediate result so you can verify the workflow step by step.
# Step 11 — Display the current value explicitly so the result/state can be inspected during execution.
print("STEP 3 · First row:", Z[0].round(3).tolist())

Expected / illustrative output

STEP 1 · Original shape: (12, 3)
STEP 2 · Explained variance: [0.98, 0.019]
STEP 3 · Reduced shape: (12, 2)
STEP 3 · First row: [1.104, 0.233]

Implementation checklist

Before you move on

Can you state what data or object enters the operation?
Can you explain what changes and what must remain invariant?
Have you checked the result on a tiny case you can verify independently?
Have you considered the main failure mode described above?
Can the operation be reproduced from code/formulas and documented assumptions?