When might you pick hierarchical clustering over K-means?
PICTURE THIS: 1, 2, 2, 8
Simple meaning
Hierarchical clustering returns a dendrogram and does not need K chosen in advance.
WHY — Clustering instead of guessing?
Why interviewers care about Clustering:
on Clustering.
the situation, the default choice, and one exception - that reads as experience.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Hierarchical clustering returns a
dendrogram and does not need K chosen in advance.
- 2Nested groups are easier
to inspect.
- 3It scales poorly with
n, so K-means or mini-batch K-means win on large tables.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Hierarchical clustering returns a dendrogram and does not need K chosen in advance. Nested groups are easier to inspect.