Back to Topic 4.2 — Data preprocessing
4.2.3Computer Science HL5 flashcards

Dimensionality reduction

Practice Flashcards

Flip to reveal answers
Card 1 of 54.2.3
4.2.3
Question

What is dimensionality reduction?

Click to reveal answer

Track your progress — Sign up free to save your progress and get smart review reminders based on spaced repetition.

All 5 Flashcards — Dimensionality reduction

Sign up free to track progress and get spaced-repetition review schedules.

Card 1definition

Question

What is dimensionality reduction?

Answer

Describing the same data with **fewer features** while keeping as much of the variation as possible.

Card 2definition

Question

What is the curse of dimensionality?

Answer

More features means an **exponentially larger space**, so data becomes sparse, distances lose meaning, and exponentially more records are needed.

Card 3comparison

Question

Feature selection or extraction — what is the difference?

Answer

**Selection** keeps a subset of the original columns. **Extraction** builds new features from combinations of them.

Card 4process

Question

Name four problems the curse of dimensionality causes.

Answer

**Overfitting**, higher **computational cost** and **memory use**, and distance metrics that **stop meaning anything**. The data also becomes hard to visualise.

Card 5concept

Question

What is always lost in dimensionality reduction?

Answer

Some **variation** — it is lossy by construction — and with extraction, **interpretability**: a component cannot be named in plain words.

Track your progress with spaced repetition

Sign up free — Aimnova tells you exactly which cards to review and when, so you remember everything before your IB exam.

Start Free