Hierarchical clustering in ML Python - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding linkage methods in hierarchical clustering

Which linkage method in hierarchical clustering merges clusters based on the maximum distance between points in the two clusters?

A Average linkage

B Single linkage

C Complete linkage

D Ward linkage

💡 Hint

Think about which method considers the farthest points when merging clusters.

Complete linkage merges clusters by considering the maximum distance between points in the two clusters. Single linkage uses the minimum distance, average linkage uses the average distance, and Ward linkage minimizes variance.

❓ Predict Output

intermediate

Output of dendrogram linkage matrix

What is the output of the following Python code snippet using scipy for hierarchical clustering linkage matrix?

ML Python

from scipy.cluster.hierarchy import linkage
import numpy as np
X = np.array([[1, 2], [3, 4], [5, 6]])
Z = linkage(X, method='single')
print(Z)

A

[[0. 1. 2.82842712 2.]
 [2. 3. 4.24264069 2.]
 [4. 5. 5.65685425 3.]]

B

[[0. 1. 2.82842712 2.]
 [2. 3. 2.82842712 2.]
 [4. 5. 4.24264069 3.]]

C

[[0. 1. 2.82842712 2.]
 [2. 3. 2.82842712 2.]
 [4. 5. 5.65685425 3.]]

D

[[0. 1. 1.41421356 2.]
 [2. 3. 2.82842712 2.]
 [4. 5. 4.24264069 3.]]

💡 Hint

Check how single linkage calculates distances between clusters.

The linkage matrix shows the clusters merged, the distance between them, and the number of original points in the new cluster. Single linkage uses the minimum distance between points in clusters.

❓ Model Choice

advanced

Choosing hierarchical clustering for data type

Which type of dataset is hierarchical clustering most suitable for compared to k-means clustering?

A Data with non-globular clusters and unknown number of clusters

B High-dimensional sparse data with many irrelevant features

C Large datasets with millions of samples

D Data with clearly separated spherical clusters and known cluster count

💡 Hint

Think about flexibility in cluster shapes and cluster count knowledge.

Hierarchical clustering works well when clusters are not spherical and the number of clusters is unknown. K-means assumes spherical clusters and requires the number of clusters upfront. Hierarchical clustering is less efficient for very large datasets.

❓ Hyperparameter

advanced

Effect of distance metric on hierarchical clustering

How does changing the distance metric from Euclidean to Manhattan affect hierarchical clustering results?

A Changing distance metric only affects k-means, not hierarchical clustering

B Clusters will always be identical regardless of distance metric

C Manhattan distance causes hierarchical clustering to fail with an error

D Clusters may differ because Manhattan distance measures distance along axes, affecting cluster shape

💡 Hint

Consider how distance metrics measure space differently.

Manhattan distance sums absolute differences along each dimension, which can change how close points appear compared to Euclidean distance. This can lead to different cluster shapes and merges in hierarchical clustering.

❓ Metrics

expert

Interpreting cophenetic correlation coefficient

What does a cophenetic correlation coefficient close to 1 indicate about a hierarchical clustering result?

A The clustering perfectly preserves the pairwise distances between original points

B The clustering poorly represents the original data distances

C The clustering has exactly one cluster containing all points

D The clustering uses single linkage method

💡 Hint

Think about what correlation close to 1 means in statistics.

A cophenetic correlation coefficient near 1 means the hierarchical clustering preserves the original pairwise distances well, indicating a good fit between the dendrogram and the data.

Practice

1. What is the main idea behind hierarchical clustering in machine learning?

easy

A. It uses a neural network to classify data points into clusters.

B. It assigns data points to clusters based on a fixed number of clusters.

C. It builds a tree of clusters by joining or splitting data points step by step.

D. It randomly assigns data points to clusters without any order.

Solution

1. Step 1: Understand hierarchical clustering concept

   Hierarchical clustering creates a tree-like structure by either merging or splitting data points stepwise.

2. Step 2: Compare with other clustering methods

   Unlike fixed cluster methods, it does not require a preset number of clusters and builds a hierarchy instead.

3. Final Answer:

   It builds a tree of clusters by joining or splitting data points step by step. -> Option C

4. Quick Check:

   Hierarchical clustering = stepwise tree building [OK]

Hint: Think of building a family tree of data points step by step [OK]

Common Mistakes:

• Confusing hierarchical clustering with k-means clustering
• Thinking it requires a fixed number of clusters upfront
• Believing it assigns clusters randomly

2. Which of the following Python code snippets correctly imports the function for hierarchical clustering from the SciPy library?

easy

A. from scipy.cluster.hierarchy import linkage

B. import sklearn.cluster.hierarchical as hc

C. from scipy.cluster import kmeans

D. import hierarchical from scipy.cluster

Solution

1. Step 1: Identify correct import for hierarchical clustering

   The function linkage from scipy.cluster.hierarchy is used for hierarchical clustering.

2. Step 2: Check other options for errors

   A has invalid syntax, B uses wrong module name (sklearn.cluster.hierarchical does not exist), C imports kmeans (not hierarchical).

3. Final Answer:

   from scipy.cluster.hierarchy import linkage -> Option A

4. Quick Check:

   Correct import = from scipy.cluster.hierarchy import linkage [OK]

Hint: Remember SciPy's hierarchy module has linkage function [OK]

Common Mistakes:

• Using sklearn.cluster.hierarchical which does not exist
• Confusing kmeans import with hierarchical clustering
• Incorrect import syntax

3. Given the following Python code using SciPy for hierarchical clustering, what will be the output of print(Z)?

from scipy.cluster.hierarchy import linkage
import numpy as np

X = np.array([[1, 2], [1, 4], [5, 2], [5, 4]])
Z = linkage(X, method='single')
print(Z)

medium

A. A 3x4 array showing the order and distance of cluster merges

B. A 4x4 distance matrix of all points

C. A list of cluster labels for each point

D. An error because method 'single' is invalid

Solution

1. Step 1: Understand linkage output format

   The linkage function returns a matrix with rows showing which clusters merged, their distance, and cluster size.

2. Step 2: Check method and output shape

   Method 'single' is valid. For 4 points, output is (4-1)=3 rows and 4 columns.

3. Final Answer:

   A 3x4 array showing the order and distance of cluster merges -> Option A

4. Quick Check:

   linkage output = cluster merges matrix [OK]

Hint: linkage returns merge info, not labels or distance matrix [OK]

Common Mistakes:

• Expecting cluster labels instead of merge matrix
• Confusing linkage output with distance matrix
• Thinking 'single' method is invalid

4. You run this code but get an error:

from scipy.cluster.hierarchy import dendrogram
import numpy as np

X = np.array([[1, 2], [3, 4], [5, 6]])
dendrogram(X)

What is the problem and how to fix it?

medium

A. The array X has wrong shape; reshape it to 1D before dendrogram().

B. You must pass a linkage matrix, not raw data, to dendrogram(). Use linkage() first.

C. dendrogram() requires labels argument; add labels=['a','b','c'].

D. You need to import dendrogram from sklearn.cluster, not scipy.

Solution

1. Step 1: Identify dendrogram input requirements

   dendrogram() expects a linkage matrix, not raw data points.

2. Step 2: Fix by computing linkage first

   Use linkage() on X to get the linkage matrix, then pass it to dendrogram().

3. Final Answer:

   You must pass a linkage matrix, not raw data, to dendrogram(). Use linkage() first. -> Option B

4. Quick Check:

   dendrogram input = linkage matrix [OK]

Hint: Always run linkage() before dendrogram() [OK]

Common Mistakes:

• Passing raw data directly to dendrogram()
• Thinking dendrogram needs labels argument
• Importing dendrogram from wrong library

5. You want to cluster customer data using hierarchical clustering but do not know how many clusters to choose. Which approach helps you decide the number of clusters without setting it upfront?

hard

A. Use PCA to reduce dimensions before clustering.

B. Use k-means clustering instead with a fixed k value.

C. Randomly assign clusters and check accuracy.

D. Cut the dendrogram at a chosen distance threshold to form clusters.

Solution

1. Step 1: Understand hierarchical clustering flexibility

   Hierarchical clustering builds a tree and allows cutting at any distance to form clusters.

2. Step 2: Use distance threshold to decide clusters

   By choosing a height to cut the dendrogram, you get clusters without presetting their number.

3. Final Answer:

   Cut the dendrogram at a chosen distance threshold to form clusters. -> Option D

4. Quick Check:

   Distance threshold cutting = flexible cluster count [OK]

Hint: Cut dendrogram by distance, not fixed cluster count [OK]

Common Mistakes:

• Thinking hierarchical clustering needs fixed cluster count upfront
• Confusing with k-means clustering method
• Ignoring dendrogram visualization for cluster choice