Choosing K (elbow method, silhouette score) in ML Python

Introduction

Choosing the right number of clusters (K) helps group data well. It makes sure clusters are clear and useful.

When you want to group customers into meaningful segments.

When organizing photos into similar groups automatically.

When analyzing patterns in sensor data to find distinct states.

When you need to decide how many groups to use in market research.

When exploring data to find natural groupings without labels.

Syntax

ML Python

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

# Elbow method steps:
# 1. For each K, fit KMeans and get inertia (sum of squared distances).
# 2. Plot K vs inertia to find the 'elbow' point.

# Silhouette score steps:
# 1. For each K, fit KMeans and predict clusters.
# 2. Calculate silhouette_score(X, labels).
# 3. Choose K with highest silhouette score.

The elbow method looks for a point where adding more clusters doesn't improve much.

Silhouette score measures how well each point fits its cluster compared to others.

Examples

Fit KMeans with 3 clusters and get inertia (lower is better).

ML Python

kmeans = KMeans(n_clusters=3, random_state=42)
kmeans.fit(X)
print(kmeans.inertia_)

Calculate silhouette score for 4 clusters to check cluster quality.

ML Python

labels = KMeans(n_clusters=4, random_state=42).fit_predict(X)
score = silhouette_score(X, labels)
print(score)

Sample Model

This code creates 3 groups of points, then tries K from 2 to 6 clusters. It prints inertia and silhouette scores for each K. The plots help find the best K by showing the elbow and highest silhouette score.

ML Python

import numpy as np
import matplotlib.pyplot as plt
from sklearn.cluster import KMeans
from sklearn.metrics import silhouette_score

# Create sample data: 3 groups around centers
np.random.seed(42)
X = np.vstack([
    np.random.normal(loc=0, scale=0.5, size=(50, 2)),
    np.random.normal(loc=5, scale=0.5, size=(50, 2)),
    np.random.normal(loc=10, scale=0.5, size=(50, 2))
])

inertias = []
sil_scores = []
K_range = range(2, 7)

for k in K_range:
    kmeans = KMeans(n_clusters=k, random_state=42)
    labels = kmeans.fit_predict(X)
    inertias.append(kmeans.inertia_)
    sil_scores.append(silhouette_score(X, labels))

print("Inertia for K=2 to 6:", inertias)
print("Silhouette scores for K=2 to 6:", sil_scores)

# Plotting results
plt.figure(figsize=(12,5))
plt.subplot(1,2,1)
plt.plot(K_range, inertias, 'bo-')
plt.xlabel('Number of clusters K')
plt.ylabel('Inertia')
plt.title('Elbow Method')

plt.subplot(1,2,2)
plt.plot(K_range, sil_scores, 'ro-')
plt.xlabel('Number of clusters K')
plt.ylabel('Silhouette Score')
plt.title('Silhouette Scores')

plt.tight_layout()
plt.show()

Important Notes

The elbow point is where inertia stops decreasing quickly.

Silhouette score ranges from -1 to 1; closer to 1 means better clusters.

Use both methods together for better decision on K.

Summary

Choosing K helps find the right number of groups in data.

Elbow method looks at inertia to find a point of diminishing returns.

Silhouette score measures how well points fit their clusters.

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