Overview
Direct Answer
Unsupervised learning is a machine learning paradigm where algorithms identify inherent patterns, clusters, and structures within datasets without requiring pre-labelled target variables. The model learns directly from raw data, inferring underlying relationships through statistical or geometric properties alone.
How It Works
Algorithms operate by optimising an objective function based solely on input features—typically minimising distances between similar data points or maximising explained variance. Common techniques include clustering algorithms (k-means, hierarchical clustering), dimensionality reduction (principal component analysis), and density estimation, which partition or transform data based on intrinsic characteristics rather than predetermined categories.
Why It Matters
Organisations value this approach because labelled datasets are expensive and time-consuming to produce at scale, whilst unlabelled data is abundantly available. It enables rapid exploratory analysis, discovery of unexpected customer segments, and cost-effective preprocessing before supervised tasks, directly reducing data annotation burden and accelerating time-to-insight.
Common Applications
Applications span customer segmentation in retail, anomaly detection in network security and fraud prevention, document clustering in content management, and gene expression analysis in genomics research. Recommendation systems leverage collaborative filtering to identify user behaviour patterns without explicit preference labels.
Key Considerations
Validation is inherently challenging—without ground truth labels, assessing result quality requires domain expertise and intrinsic metrics (silhouette score, within-cluster variance). Results remain highly sensitive to algorithm selection, initialisation, and hyperparameters, often requiring substantial experimentation.
Cross-References(1)
Referenced By2 terms mention Unsupervised Learning
Other entries in the wiki whose definition references Unsupervised Learning — useful for understanding how this concept connects across Machine Learning and adjacent domains.
More in Machine Learning
K-Means Clustering
Unsupervised LearningA partitioning algorithm that divides data into k clusters by minimising the distance between points and their cluster centroids.
SMOTE
Feature Engineering & SelectionSynthetic Minority Over-sampling Technique — a method for addressing class imbalance by generating synthetic examples of the minority class.
Feature Store
MLOps & ProductionA centralised repository for storing, managing, and serving machine learning features, ensuring consistency between training and inference environments across an organisation.
SHAP Values
MLOps & ProductionA game-theoretic approach to explaining individual model predictions by computing each feature's marginal contribution, based on Shapley values from cooperative game theory.
Underfitting
Training TechniquesWhen a model is too simple to capture the underlying patterns in the data, resulting in poor performance on both training and test data.
Hierarchical Clustering
Unsupervised LearningA clustering method that builds a tree-like hierarchy of clusters through successive merging or splitting of groups.
XGBoost
Supervised LearningAn optimised distributed gradient boosting library designed for speed and performance in machine learning competitions and production.
Feature Engineering
Feature Engineering & SelectionThe process of using domain knowledge to create, select, and transform input variables to improve model performance.