Mean shift clustering in ML Python - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding the core idea of Mean Shift Clustering

What is the main principle behind the Mean Shift clustering algorithm?

A It partitions data by minimizing the sum of squared distances to cluster centers initialized randomly.

B It builds a hierarchical tree of clusters by merging closest pairs until one cluster remains.

C It assigns points to clusters based on a fixed radius without updating cluster centers.

D It iteratively shifts each data point towards the average of points in its neighborhood to find dense regions.

💡 Hint

Think about how the algorithm finds clusters by moving points towards areas with many neighbors.

Mean Shift works by moving points towards the mean of points in their local neighborhood, effectively climbing the density gradient to find cluster centers.

❓ Predict Output

intermediate

Output of Mean Shift cluster centers

Given the following 2D points and bandwidth, what will be the approximate cluster centers found by Mean Shift?

ML Python

import numpy as np
from sklearn.cluster import MeanShift

points = np.array([[1, 2], [1, 3], [2, 2], [8, 8], [8, 9], [9, 8]])
ms = MeanShift(bandwidth=2)
ms.fit(points)
centers = ms.cluster_centers_
print(centers)

A

[[2.0 3.0]
 [9.0 9.0]]

B

[[1.0 2.0]
 [8.0 8.0]
 [9.0 9.0]]

C

[[1.33333333 2.33333333]
 [8.33333333 8.33333333]]

D

[[1.5 2.5]
 [8.5 8.5]
 [9.5 9.5]]

💡 Hint

Mean Shift averages points close to each other within the bandwidth to find centers.

The first cluster center is the average of points near (1,2) and the second is the average of points near (8,8). The output shows these two centers.

❓ Hyperparameter

advanced

Effect of bandwidth on Mean Shift clustering

What happens if you increase the bandwidth parameter in Mean Shift clustering?

A Clusters become fewer and larger because the neighborhood radius grows, merging more points.

B Clusters become more numerous and smaller because points are grouped more tightly.

C The algorithm runs faster but produces the same number of clusters.

D The algorithm ignores points outside the bandwidth and creates empty clusters.

💡 Hint

Think about how a bigger neighborhood affects grouping points.

Increasing bandwidth means each point considers a larger neighborhood, so clusters merge into bigger groups, reducing the total number.

❓ Metrics

advanced

Choosing a metric to evaluate Mean Shift clustering

Which metric is most appropriate to evaluate the quality of clusters produced by Mean Shift when true labels are unknown?

A Silhouette Score, because it measures how similar points are within clusters compared to other clusters.

B Accuracy, because it compares predicted labels to true labels directly.

C Mean Squared Error, because it measures distance from points to cluster centers.

D Cross-Entropy Loss, because it measures classification error probabilities.

💡 Hint

Think about metrics that work without knowing the true groupings.

Silhouette Score evaluates clustering quality based on cohesion and separation without needing true labels, making it ideal for unsupervised methods like Mean Shift.

🔧 Debug

expert

Debugging Mean Shift convergence issue

Consider this code snippet using Mean Shift. It runs but the cluster centers do not change after the first iteration, causing poor clustering. What is the likely cause?

ML Python

import numpy as np
from sklearn.cluster import MeanShift

points = np.array([[0, 0], [0, 1], [1, 0], [10, 10], [10, 11], [11, 10]])
ms = MeanShift(bandwidth=0.5)
ms.fit(points)
print(ms.cluster_centers_)

A The points array is not normalized, causing the algorithm to fail silently.

B The bandwidth is too small, so points do not have neighbors to shift towards, causing no movement.

C Mean Shift requires labels to be provided, which are missing here.

D The fit method was called on the wrong variable 'ms' instead of 'ms'.

💡 Hint

Check if the bandwidth covers enough points to allow shifting.

A very small bandwidth means each point sees almost no neighbors, so the mean shift step does not move points, resulting in poor clustering.

Practice

1. What is the main idea behind mean shift clustering?

easy

A. It moves points toward areas with many nearby points to find clusters.

B. It assigns points randomly to clusters without considering neighbors.

C. It requires the number of clusters to be fixed before running.

D. It uses a decision tree to split data into clusters.

Solution

1. Step 1: Understand mean shift clustering concept

   Mean shift clustering works by shifting points toward the densest area nearby, grouping points naturally.

2. Step 2: Compare options with concept

   Only It moves points toward areas with many nearby points to find clusters. describes moving points toward dense areas. Others describe unrelated methods.

3. Final Answer:

   It moves points toward areas with many nearby points to find clusters. -> Option A

4. Quick Check:

   Mean shift = moves points to dense areas [OK]

Hint: Mean shift moves points to dense spots, no fixed cluster count [OK]

Common Mistakes:

• Thinking mean shift needs fixed cluster count
• Confusing mean shift with random assignment
• Believing mean shift uses decision trees

2. Which of the following is the correct way to import MeanShift from scikit-learn in Python?

easy

A. import MeanShift from sklearn.cluster

B. from sklearn.cluster import MeanShift

C. from sklearn import MeanShift

D. import sklearn.cluster.MeanShift

Solution

1. Step 1: Recall correct import syntax in Python

   Python uses 'from module import class' to import specific classes.

2. Step 2: Match syntax to options

   from sklearn.cluster import MeanShift uses 'from sklearn.cluster import MeanShift', which is correct. Others have wrong syntax.

3. Final Answer:

   from sklearn.cluster import MeanShift -> Option B

4. Quick Check:

   Correct import = from module import class [OK]

Hint: Use 'from module import class' to import specific classes [OK]

Common Mistakes:

• Using 'import' with 'from' incorrectly
• Trying to import class directly from package
• Missing 'import' keyword or wrong order

3. What will be the output cluster centers after running this code?

from sklearn.cluster import MeanShift
import numpy as np
X = np.array([[1, 2], [1, 4], [1, 0], [10, 2], [10, 4], [10, 0]])
ms = MeanShift(bandwidth=2)
ms.fit(X)
print(ms.cluster_centers_)

medium

A. [[1. 2.] [10. 2.]]

B. [[1. 2.] [10. 4.]]

C. [[1. 2.] [10. 0.]]

D. [[5.5 2. ] [10. 2.]]

Solution

1. Step 1: Understand bandwidth and data points

   Bandwidth=2 means points within distance 2 form clusters. Points near (1,2) cluster together; points near (10,2) cluster together.

2. Step 2: Identify cluster centers

   Points at (1,0), (1,2), (1,4) average to (1,2). Points at (10,0), (10,2), (10,4) average to (10,2).

3. Final Answer:

   [[1. 2.] [10. 2.]] -> Option A

4. Quick Check:

   Clusters center near mean of close points [OK]

Hint: Clusters center near average of close points within bandwidth [OK]

Common Mistakes:

• Confusing cluster centers with original points
• Ignoring bandwidth effect on grouping
• Averaging points incorrectly

4. Identify the error in this MeanShift clustering code:

from sklearn.cluster import MeanShift
X = [[1, 2], [2, 3], [3, 4]]
ms = MeanShift()
ms.fit(X)
print(mss.labels_)

medium

A. Variable name 'ms' is used before assignment.

B. Input data X should be a NumPy array, not a list.

C. MeanShift requires bandwidth parameter to be set explicitly.

D. The print statement uses 'mss' but the object is named 'ms'.

Solution

1. Step 1: Check variable assignments and usage

   The clustering object is assigned to variable ms.

2. Step 2: Examine the print statement

   The print statement attempts to access mss.labels_, but mss is undefined. This will raise a NameError.

3. Step 3: Match to options

   The print statement uses 'mss' but the object is named 'ms'. correctly describes this issue: the print uses 'mss' while the object is 'ms'.

4. Final Answer:

   The print statement uses 'mss' but the object is named 'ms'. -> Option D

5. Quick Check:

   Typo in variable name causes runtime error [OK]

Hint: Check variable names carefully for typos in print statements [OK]

Common Mistakes:

• Assuming bandwidth is always required
• Thinking lists are invalid input
• Confusing variable names in print

5. You have a dataset with two dense groups close together and some scattered points far away. How should you set the bandwidth parameter in MeanShift to correctly identify the two main clusters?

hard

A. Set bandwidth to zero to get exact points as clusters.

B. Set bandwidth larger than the distance between the two groups to merge them.

C. Set bandwidth smaller than the distance between the two groups to separate them.

D. Set bandwidth equal to zero to ignore scattered points.

Solution

1. Step 1: Understand bandwidth effect on clustering

   Bandwidth controls neighborhood size. Smaller bandwidth means clusters form from closer points only.

2. Step 2: Apply to two close groups

   To keep two groups separate, bandwidth must be smaller than distance between groups, so they don't merge.

3. Step 3: Consider scattered points

   Scattered points may form their own clusters or be ignored depending on bandwidth, but main goal is separating main groups.

4. Final Answer:

   Set bandwidth smaller than the distance between the two groups to separate them. -> Option C

5. Quick Check:

   Bandwidth < distance = separate clusters [OK]

Hint: Bandwidth smaller than group distance keeps clusters separate [OK]

Common Mistakes:

• Setting bandwidth too large merges clusters
• Using zero bandwidth causes errors
• Ignoring scattered points effect