Choosing K (elbow method, silhouette score) in ML Python - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding the Elbow Method

When using the elbow method to choose the number of clusters K in K-means clustering, what does the 'elbow' point represent?

A The point where clusters have equal sizes

B The point where adding more clusters does not significantly reduce the within-cluster sum of squares (WCSS)

C The maximum number of clusters allowed by the algorithm

D The point where the silhouette score is at its lowest value

💡 Hint

Think about when adding more clusters stops giving much better grouping.

The elbow point is where the decrease in WCSS slows down, indicating that adding more clusters beyond this point does not improve clustering significantly.

🧠 Conceptual

intermediate

Silhouette Score Interpretation

What does a silhouette score close to 1 indicate about the clustering quality?

A Clusters are well separated and points are close to their own cluster center

B Clusters overlap heavily and points are far from their cluster center

C The number of clusters is too high

D The clustering algorithm failed to converge

💡 Hint

Higher silhouette scores mean better clustering.

A silhouette score near 1 means each point is much closer to its own cluster than to others, indicating good clustering.

❓ Predict Output

advanced

Output of Silhouette Score Calculation

What is the output of the following Python code snippet?

ML Python

from sklearn.datasets import make_blobs
from sklearn.cluster import KMeans
from sklearn.metrics import silhouette_score

X, _ = make_blobs(n_samples=100, centers=3, cluster_std=0.5, random_state=42)
model = KMeans(n_clusters=3, random_state=42)
labels = model.fit_predict(X)
score = silhouette_score(X, labels)
print(round(score, 2))

A 0.00

B 0.25

C 1.00

D 0.75

💡 Hint

The data has 3 clear clusters with low spread.

The silhouette score is high (~0.75) because the clusters are well separated and compact.

❓ Metrics

advanced

Choosing K Using Silhouette Scores

You run K-means clustering for K values from 2 to 6 and get these silhouette scores: {2: 0.45, 3: 0.62, 4: 0.58, 5: 0.55, 6: 0.50}. Which K should you choose based on silhouette score?

A K = 3

B K = 6

C K = 2

D K = 4

💡 Hint

Pick the K with the highest silhouette score.

K=3 has the highest silhouette score (0.62), indicating the best cluster separation and cohesion.

🔧 Debug

expert

Identifying the Error in Elbow Method Plot Code

What error will this code raise when trying to plot the elbow curve?

import matplotlib.pyplot as plt
from sklearn.cluster import KMeans
from sklearn.datasets import make_blobs

X, _ = make_blobs(n_samples=100, centers=4, random_state=0)

wcss = []
for k in range(1, 6):
    model = KMeans(n_clusters=k)
    model.fit(X)
    wcss.append(model.inertia_)

plt.plot(range(1, 6), wcss)
plt.xlabel('Number of clusters')
plt.ylabel('WCSS')
plt.title('Elbow Method')
plt.show()

A ValueError because KMeans requires n_init parameter explicitly

B TypeError because model.inertia_ is not a float

C No error; the code runs and plots the elbow curve correctly

D NameError because matplotlib.pyplot is not imported

💡 Hint

Check if all required imports and parameters are correct for recent sklearn versions.

The code runs without error and plots the elbow curve. The default n_init changed in newer sklearn but does not cause error here.

Practice

1. What is the main goal when choosing the number of clusters K in clustering algorithms?

easy

A. To find the number of groups that best represent the data

B. To maximize the number of clusters regardless of data

C. To minimize the number of clusters to one

D. To randomly select a number without analysis

Solution

1. Step 1: Understand the purpose of clustering

   Clustering groups similar data points together to find patterns.

2. Step 2: Identify the role of choosing K

   Choosing K means deciding how many groups best represent the data structure.

3. Final Answer:

   To find the number of groups that best represent the data -> Option A

4. Quick Check:

   Choosing K = best data groups [OK]

Hint: Choose K to best represent data groups, not randomly [OK]

Common Mistakes:

• Picking K without checking data patterns
• Choosing too many clusters blindly
• Ignoring the meaning of clusters

2. Which of the following Python code snippets correctly computes the silhouette score for clustering results stored in labels with data X?

easy

A. from sklearn.metrics import silhouette_score
score = silhouette_score(labels, X)

B. from sklearn.cluster import silhouette_score
score = silhouette_score(labels, X)

C. from sklearn.metrics import silhouette_score
score = silhouette_score(X, labels)

D. from sklearn.cluster import silhouette_score
score = silhouette_score(X, labels)

Solution

1. Step 1: Check the correct import

   The silhouette_score function is in sklearn.metrics, not sklearn.cluster.

2. Step 2: Verify function parameters order

   The function takes data first (X), then cluster labels (labels).

3. Final Answer:

   from sklearn.metrics import silhouette_score\nscore = silhouette_score(X, labels) -> Option C

4. Quick Check:

   Correct import and parameter order = from sklearn.metrics import silhouette_score score = silhouette_score(X, labels) [OK]

Hint: Import from metrics and pass data first, labels second [OK]

Common Mistakes:

• Importing silhouette_score from wrong module
• Swapping data and labels in function call
• Using cluster module instead of metrics

3. Given the following code, what will be the printed silhouette score?

from sklearn.cluster import KMeans
from sklearn.metrics import silhouette_score
import numpy as np

X = np.array([[1, 2], [1, 4], [1, 0], [10, 2], [10, 4], [10, 0]])
kmeans = KMeans(n_clusters=2, random_state=42).fit(X)
labels = kmeans.labels_
score = silhouette_score(X, labels)
print(round(score, 2))

medium

A. 0.50

B. 0.74

C. 0.30

D. 1.00

Solution

1. Step 1: Understand the data and clustering

   The data has two clear groups around [1, x] and [10, x], so KMeans with 2 clusters fits well.

2. Step 2: Calculate silhouette score

   Silhouette score measures cluster quality; for well-separated clusters, it is close to 1. Running the code gives approximately 0.74.

3. Final Answer:

   0.74 -> Option B

4. Quick Check:

   Well-separated clusters give silhouette ~0.74 [OK]

Hint: Well-separated clusters usually have silhouette > 0.7 [OK]

Common Mistakes:

• Expecting silhouette score to be 1.0 always
• Confusing silhouette with inertia
• Ignoring cluster separation in score

4. You run the elbow method but the inertia keeps decreasing smoothly without a clear elbow point. What is the best way to fix this issue?

medium

A. Try silhouette score to find the best K instead

B. Increase the number of clusters to the maximum possible

C. Ignore the elbow method and pick K=1

D. Use random K values without checking metrics

Solution

1. Step 1: Identify the problem with elbow method

   If inertia decreases smoothly, no clear elbow means it's hard to pick K by this method.

2. Step 2: Use alternative metric

   Silhouette score measures cluster quality differently and can help find the best K when elbow is unclear.

3. Final Answer:

   Try silhouette score to find the best K instead -> Option A

4. Quick Check:

   Use silhouette when elbow is unclear [OK]

Hint: Switch to silhouette score if elbow is unclear [OK]

Common Mistakes:

• Forcing a large K without reason
• Ignoring metrics and guessing K
• Picking K=1 without analysis

5. You have a dataset with 5 natural clusters but the elbow method suggests K=3 and silhouette score suggests K=5. Which K should you choose and why?

hard

A. Choose K=3 because elbow method always gives the best K

B. Choose K=10 to overfit the data

C. Choose K=1 to simplify the model

D. Choose K=5 because silhouette score better reflects cluster separation

Solution

1. Step 1: Compare elbow and silhouette methods

   Elbow method focuses on inertia reduction, which can miss subtle clusters; silhouette measures cluster quality and separation.

2. Step 2: Match method to data nature

   Since the dataset has 5 natural clusters, silhouette score's suggestion aligns better with true structure.

3. Final Answer:

   Choose K=5 because silhouette score better reflects cluster separation -> Option D

4. Quick Check:

   Silhouette score > elbow for true cluster count [OK]

Hint: Trust silhouette score for natural cluster counts [OK]

Common Mistakes:

• Blindly trusting elbow method over silhouette
• Choosing too few clusters ignoring data
• Overfitting by choosing too many clusters