K-means via scipy vs scikit-learn - When to Use Which

The Big Idea

What if you could find hidden groups in your data with just a few lines of code?

The Scenario

Imagine you have a big box of mixed colored beads and you want to group them by color manually. You try sorting each bead one by one, but it takes forever and you keep mixing some beads up.

The Problem

Sorting and grouping data by hand is slow and mistakes happen easily. When you have thousands of data points, it becomes impossible to do without errors or spending hours.

The Solution

K-means clustering automatically groups data points into clusters based on similarity. Using libraries like scipy or scikit-learn, you can quickly and accurately find these groups with just a few lines of code.

Before vs After

✗ Before

for point in data:
    # check distance to each cluster center
    # assign point to closest cluster
    # update cluster centers manually

✓ After

from sklearn.cluster import KMeans
kmeans = KMeans(n_clusters=3).fit(data)
labels = kmeans.labels_

What It Enables

You can easily discover hidden groups in your data, making complex patterns clear and actionable.

Real Life Example

A store uses K-means to group customers by shopping habits, helping them send personalized offers that increase sales.

Key Takeaways

Manual grouping is slow and error-prone.

K-means automates grouping based on data similarity.

Using scipy or scikit-learn makes clustering fast and easy.

Practice

1. What is the main difference between K-means clustering in scipy and scikit-learn?

easy

A. scikit-learn does not support K-means clustering.

B. scikit-learn requires manual centroid initialization, but scipy does not.

C. scipy automatically plots clusters, but scikit-learn does not.

D. scipy requires separate steps for centroid calculation and label assignment, while scikit-learn combines them.

Solution

1. Step 1: Understand K-means steps in scipy

   In scipy, you first find centroids using kmeans, then assign labels with vq.

2. Step 2: Understand K-means in scikit-learn

   scikit-learn combines these steps in one KMeans class that fits and predicts labels together.

3. Final Answer:

   scipy requires separate steps for centroid calculation and label assignment, while scikit-learn combines them. -> Option D

4. Quick Check:

   K-means steps differ: separate in scipy, combined in scikit-learn [OK]

Hint: Remember: scipy splits steps, scikit-learn combines [OK]

Common Mistakes:

• Thinking scikit-learn lacks K-means
• Assuming scipy auto-assigns labels
• Confusing plotting features with clustering steps

2. Which of the following is the correct way to import K-means functions from scipy for clustering?

easy

A. import scipy.kmeans as km

B. from scipy.kmeans import cluster

C. from scipy.cluster.vq import kmeans, vq

D. from sklearn.cluster import kmeans

Solution

1. Step 1: Recall scipy K-means import syntax

   The correct import for K-means in scipy is from scipy.cluster.vq importing kmeans and vq.

2. Step 2: Check other options

   Options A and B use incorrect module names, and D is from scikit-learn, not scipy.

3. Final Answer:

   from scipy.cluster.vq import kmeans, vq -> Option C

4. Quick Check:

   Correct scipy import = from scipy.cluster.vq import kmeans, vq [OK]

Hint: Use scipy.cluster.vq for K-means imports [OK]

Common Mistakes:

• Confusing sklearn imports with scipy
• Using wrong module names like scipy.kmeans
• Trying to import cluster from scipy directly

3. Given the code below, what will be the output of labels?

import numpy as np
from scipy.cluster.vq import kmeans, vq

data = np.array([[1, 2], [1, 4], [1, 0], [10, 2], [10, 4], [10, 0]])
centroids, _ = kmeans(data, np.array([[1, 2], [10, 2]]))
labels, _ = vq(data, centroids)
print(labels.tolist())

medium

A. [0, 0, 0, 1, 1, 1]

B. [1, 1, 1, 0, 0, 0]

C. [0, 1, 0, 1, 0, 1]

D. [1, 0, 1, 0, 1, 0]

Solution

1. Step 1: Understand data and centroids

   Data has two groups: points near (1, y) and points near (10, y). Kmeans with 2 clusters finds centroids near these groups.

2. Step 2: Assign labels with vq

   Points near (1, y) get label 0, points near (10, y) get label 1. So first three points labeled 0, last three labeled 1.

3. Final Answer:

   [0, 0, 0, 1, 1, 1] -> Option A

4. Quick Check:

   Clusters split by x-coordinate: left=0, right=1 [OK]

Hint: Group points by centroid proximity for labels [OK]

Common Mistakes:

• Assuming labels are reversed
• Mixing up label order
• Expecting labels to be random

4. What is wrong with this code snippet using scipy for K-means clustering?

import numpy as np
from scipy.cluster.vq import kmeans

data = np.array([[1, 2], [3, 4], [5, 6]])
centroids, labels = kmeans(data, 2)
print(labels)

medium

A. kmeans returns centroids and distortion, not labels.

B. Data array shape is invalid for kmeans.

C. kmeans requires 3 clusters, not 2.

D. Missing import for vq function.

Solution

1. Step 1: Check kmeans return values

   kmeans returns centroids and distortion value, not labels.

2. Step 2: Identify correct label assignment

   Labels must be assigned using vq with data and centroids after kmeans.

3. Final Answer:

   kmeans returns centroids and distortion, not labels. -> Option A

4. Quick Check:

   kmeans output ≠ labels; use vq for labels [OK]

Hint: Remember: kmeans returns centroids, not labels [OK]

Common Mistakes:

• Expecting kmeans to return labels
• Not using vq to assign labels
• Confusing distortion with labels

5. You want to cluster a dataset using K-means and compare results between scipy and scikit-learn. Which approach correctly ensures comparable cluster labels?

hard

A. Run scipy's kmeans only, then run scikit-learn's KMeans without setting random_state, compare labels directly.

B. Run scipy's kmeans and vq, then run scikit-learn's KMeans with same n_clusters and random_state, compare labels directly.

C. Run scikit-learn's KMeans only, then assign labels manually using scipy's vq with random centroids.

D. Run scipy's kmeans and assign labels randomly, then run scikit-learn's KMeans with default settings.

Solution

1. Step 1: Understand label consistency

   To compare cluster labels, both methods must use the same number of clusters and fixed random seed for reproducibility.

2. Step 2: Apply correct procedure

   Use scipy's kmeans and vq with fixed initialization, and scikit-learn's KMeans with same n_clusters and random_state. Then compare labels.

3. Final Answer:

   Run scipy's kmeans and vq, then run scikit-learn's KMeans with same n_clusters and random_state, compare labels directly. -> Option B

4. Quick Check:

   Matching clusters need same params and fixed seed [OK]

Hint: Fix random_state and n_clusters to compare labels [OK]

Common Mistakes:

• Not fixing random_state causing label mismatch
• Assigning labels randomly in scipy
• Comparing labels without same cluster count