Clustering Quiz
Check your understanding of clustering — what K-Means optimizes, where it breaks, what density-based methods add, and how linkage choices change hierarchies.
Exercise
What objective does K-Means minimize?
Need a hint?
It's also called inertia.
Exercise
On which data shape does K-Means fail badly?
Need a hint?
K-Means assigns each point to the nearest centroid — what geometry does that impose?
Exercise
How does the elbow method choose k?
Need a hint?
Plot inertia against k and look at the shape of the curve.
Exercise
What can DBSCAN do that K-Means cannot?
Need a hint?
DBSCAN's clusters are regions of high density.
Exercise
Single linkage in hierarchical clustering is prone to which artifact?
Need a hint?
It merges clusters based on their two closest points.
Exercise
K-Means minimizes within-cluster sum of squares by alternating assign and update steps. In the ML project loop, that quantity being minimized is which slot?
Need a hint?
It's the definition of a good clustering — the thing the algorithm drives down.
Exercise
Transfer test — a technique this course did NOT teach: a confusion matrix with precision and recall. Which slot of the ML project loop does it belong to?
Need a hint?
It's a way to measure how good predictions are.