Unsupervised Learning

What if you have data but no labels? Unsupervised learning finds hidden structure in data on its own — grouping similar items together, reducing noise, and discovering patterns that humans couldn't spot manually.

Why No Labels?

Labelling data is expensive and slow. Imagine having 1 million customer purchase records. Hiring humans to label each customer's "type" would be impractical. Unsupervised learning can automatically segment those customers into groups based on purchasing behaviour — no labels needed.

K-Means Clustering

K-Means is the most popular clustering algorithm. It splits data into K groups by minimising the distance between each point and its cluster centre (centroid).

from sklearn.cluster import KMeans
import numpy as np

# Generate sample data
X = np.random.randn(300, 2)
X[:100] += [3, 3]   # cluster 1
X[100:200] += [-3, 3]  # cluster 2
# cluster 3 stays at origin

kmeans = KMeans(n_clusters=3, random_state=42)
labels = kmeans.fit_predict(X)
centroids = kmeans.cluster_centers_

print(f"Inertia (within-cluster variance): {kmeans.inertia_:.2f}")

Choosing K — The Elbow Method

The hardest part of K-Means is choosing K. The elbow method plots inertia (within-cluster variance) vs K. The "elbow" — where the curve bends — is the optimal K.

Hierarchical Clustering

Instead of specifying K upfront, hierarchical clustering builds a dendrogram (a tree of merges). You cut the tree at any level to get any number of clusters.

DBSCAN — Density-Based Clustering

DBSCAN groups points that are closely packed together and marks isolated points as noise/outliers. It can find clusters of arbitrary shape and does not require specifying K in advance.

Principal Component Analysis (PCA)

PCA is not a clustering algorithm — it's a dimensionality reduction technique. It finds new axes (principal components) that capture the maximum variance in data, allowing you to represent high-dimensional data in 2D or 3D without losing too much information.

Common use cases: Visualising 50-dimensional customer data in 2D, compressing image features before training a classifier, removing correlated features.

from sklearn.decomposition import PCA
from sklearn.datasets import load_digits

X, y = load_digits(return_X_y=True)  # 1797 images, 64 features each

pca = PCA(n_components=2)
X_2d = pca.fit_transform(X)

# Explained variance tells you info retained
print(f"Variance explained: {pca.explained_variance_ratio_.sum():.1%}")
# → Variance explained: 28.5%  (use more components for more info)

t-SNE — Visualising High-Dimensional Data

t-SNE (t-distributed Stochastic Neighbour Embedding) is designed purely for visualisation. It preserves local neighbourhood structure, making clusters visually obvious when plotted in 2D. Unlike PCA, it's non-linear and not suitable for preprocessing before training.

Anomaly Detection

Anomaly detection finds rare events that look different from normal data. Examples: credit card fraud, network intrusion, manufacturing defects.

Frequently Asked Questions