K-Means clustering in ML Python

Introduction

K-Means clustering helps group similar things together automatically. It finds patterns without needing labels.

Grouping customers by buying habits to offer better deals.

Organizing photos by similar colors or shapes.

Segmenting areas on a map based on weather patterns.

Finding groups of similar documents or articles.

Detecting unusual data points by seeing which group they don't fit.

Syntax

ML Python

from sklearn.cluster import KMeans

kmeans = KMeans(n_clusters=k, random_state=seed)
kmeans.fit(data)
labels = kmeans.labels_
centers = kmeans.cluster_centers_

n_clusters is how many groups you want to find.

random_state helps get the same result every time you run it.

Examples

This finds 3 groups in the data with a fixed random seed.

ML Python

kmeans = KMeans(n_clusters=3, random_state=42)
kmeans.fit(data)

This gets the group number for each data point after fitting.

ML Python

labels = kmeans.labels_

This gets the center points of each group found.

ML Python

centers = kmeans.cluster_centers_

Sample Model

This program groups 6 points into 2 clusters. It prints which group each point belongs to and the center of each group.

ML Python

from sklearn.cluster import KMeans
import numpy as np

# Sample data: points in 2D space
data = np.array([
    [1, 2], [1, 4], [1, 0],
    [10, 2], [10, 4], [10, 0]
])

# Create KMeans with 2 clusters
kmeans = KMeans(n_clusters=2, random_state=0)

# Fit the model to data
kmeans.fit(data)

# Get cluster labels for each point
labels = kmeans.labels_

# Get cluster centers
centers = kmeans.cluster_centers_

print("Labels:", labels)
print("Centers:", centers)

Important Notes

K-Means works best when groups are round and similar size.

Choosing the right number of clusters (k) is important and can be tricky.

Random starting points can change results; setting random_state helps keep results consistent.

Summary

K-Means finds groups in data without labels.

You choose how many groups to find with n_clusters.

It returns group labels and center points for each group.

Practice

1. What does the n_clusters parameter in K-Means control?

easy

A. The initial random seed for cluster centers

B. The maximum number of iterations for the algorithm

C. The number of groups (clusters) to find in the data

D. The distance metric used to measure similarity

Solution

1. Step 1: Understand the role of n_clusters

   The n_clusters parameter tells K-Means how many groups to split the data into.

2. Step 2: Compare with other parameters

   Other parameters control iterations, distance, or randomness, but n_clusters specifically sets group count.

3. Final Answer:

   The number of groups (clusters) to find in the data -> Option C

4. Quick Check:

   n_clusters = number of groups [OK]

Hint: Remember: n_clusters means how many groups you want [OK]

Common Mistakes:

• Confusing n_clusters with max iterations
• Thinking n_clusters sets distance metric
• Assuming n_clusters controls randomness

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

easy

A. from sklearn import KMeans.cluster

B. import KMeans from sklearn.cluster

C. import sklearn.cluster.KMeans

D. from sklearn.cluster import KMeans

Solution

1. Step 1: Recall Python import syntax

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

2. Step 2: Match correct syntax for KMeans

   The correct import is from sklearn.cluster import KMeans.

3. Final Answer:

   from sklearn.cluster import KMeans -> Option D

4. Quick Check:

   Correct import syntax = from sklearn.cluster import KMeans [OK]

Hint: Use 'from module import class' for importing classes [OK]

Common Mistakes:

• Using wrong import order
• Trying to import with 'import' and 'from' combined incorrectly
• Using dot notation in import statement

3. Given the code below, what will be the output of print(kmeans.labels_)?

from sklearn.cluster import KMeans
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=0).fit(X)
print(kmeans.labels_)

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 grouping

   The first three points are close together near (1, y), the last three near (10, y), so KMeans will group first three as one cluster and last three as another.

2. Step 2: Check label assignment

   KMeans assigns cluster labels starting from 0. The first cluster gets label 0, second cluster label 1. But the cluster near (10, y) is assigned label 0 and near (1, y) label 1 due to initialization and fitting.

3. Final Answer:

   [1 1 1 0 0 0] -> Option B

4. Quick Check:

   Close points share label 0 or 1 [OK]

Hint: Clusters group close points; labels start at 0 [OK]

Common Mistakes:

• Assuming labels start at 1
• Mixing cluster order
• Ignoring spatial grouping

4. What is wrong with the following K-Means code snippet?

from sklearn.cluster import KMeans
X = [[1, 2], [1, 4], [1, 0]]
kmeans = KMeans(n_clusters=4)
kmeans.fit(X)
print(kmeans.labels_)

medium

A. The number of clusters (4) is greater than the number of data points (3)

B. The data X should be a numpy array, not a list

C. The KMeans class requires a random_state parameter

D. The fit method should be called with labels, not data

Solution

1. Step 1: Check cluster count vs data points

   There are only 3 data points but 4 clusters requested, which is invalid because you cannot have more clusters than points.

2. Step 2: Validate other code parts

   Using a list for X is allowed, random_state is optional, and fit expects data, not labels.

3. Final Answer:

   The number of clusters (4) is greater than the number of data points (3) -> Option A

4. Quick Check:

   Clusters ≤ data points [OK]

Hint: Clusters cannot exceed number of data points [OK]

Common Mistakes:

• Thinking data must be numpy array
• Believing random_state is mandatory
• Confusing fit input as labels

5. You have a dataset with 3 natural groups, but you run K-Means with n_clusters=5. What is the likely effect on the clustering result?

hard

A. K-Means will split some natural groups into smaller clusters, causing over-segmentation

B. K-Means will ignore extra clusters and only find 3 groups

C. K-Means will fail to run and throw an error

D. K-Means will merge groups to reduce clusters to 3 automatically

Solution

1. Step 1: Understand cluster count effect

   Setting more clusters than natural groups causes K-Means to split existing groups into smaller parts.

2. Step 2: Check K-Means behavior

   K-Means does not reduce cluster count automatically or throw error if clusters exceed natural groups; it always finds exactly n_clusters.

3. Final Answer:

   K-Means will split some natural groups into smaller clusters, causing over-segmentation -> Option A

4. Quick Check:

   More clusters than groups = splitting groups [OK]

Hint: More clusters than groups splits groups into smaller parts [OK]

Common Mistakes:

• Thinking K-Means auto-adjusts cluster count
• Expecting error when clusters > natural groups
• Assuming extra clusters are ignored