Matrix Factorisation — Technology Wiki

Overview

Direct Answer

Matrix factorisation is a mathematical technique that decomposes a high-dimensional matrix into a product of lower-dimensional matrices, typically to uncover latent patterns or reduce computational complexity. It is foundational to collaborative filtering and dimensionality reduction in machine learning applications.

How It Works

The method approximates an original matrix (often sparse, such as user-item ratings) as the product of two or more smaller matrices whose dimensions correspond to latent factors. Algorithms such as Singular Value Decomposition (SVD) or non-negative matrix factorisation iteratively adjust these factor matrices to minimise reconstruction error, exposing hidden features that explain observed data structure.

Why It Matters

The technique reduces memory footprint and computational cost whilst preserving predictive signal, enabling scalable processing of sparse datasets. In recommendation engines and information retrieval, it delivers significant accuracy gains and faster inference compared to dense similarity approaches, directly impacting user engagement and operational efficiency.

Common Applications

Primary use cases include collaborative filtering for e-commerce and streaming platforms (predicting user preferences from implicit feedback), topic modelling in document analysis, and feature extraction in image and signal processing. It is also employed in link prediction for social networks and latent semantic indexing for search systems.

Key Considerations

Practitioners must balance model complexity and overfitting risk, select appropriate factorisation rank (number of latent factors), and handle sparsity carefully. Cold-start problems persist when users or items lack historical interactions, and interpretability of discovered latent factors remains challenging.

Cross-References(1)

Machine Learning

Dimensionality Reduction

Related in Unsupervised Learning

Dimensionality Reduction

Techniques that reduce the number of input variables in a dataset while preserving essential information and structure.

Principal Component Analysis

A dimensionality reduction technique that transforms data into orthogonal components ordered by the amount of variance they explain.

t-SNE

t-Distributed Stochastic Neighbour Embedding — a technique for visualising high-dimensional data in two or three dimensions.

UMAP

Uniform Manifold Approximation and Projection — a dimensionality reduction technique for visualisation and general non-linear reduction.

Clustering

Unsupervised learning technique that groups similar data points together based on inherent patterns without predefined labels.

K-Means Clustering

A partitioning algorithm that divides data into k clusters by minimising the distance between points and their cluster centroids.

DBSCAN

Density-Based Spatial Clustering of Applications with Noise — a clustering algorithm that finds arbitrarily shaped clusters based on density.

Hierarchical Clustering

A clustering method that builds a tree-like hierarchy of clusters through successive merging or splitting of groups.

Association Rule Learning

A method for discovering interesting relationships and patterns between variables in large datasets.

Collaborative Filtering

A recommendation technique that makes predictions based on the collective preferences and behaviour of many users.

Content-Based Filtering

A recommendation approach that suggests items similar to those a user has previously liked, based on item attributes.

More in Machine Learning

Bagging

Advanced Methods

Bootstrap Aggregating — an ensemble method that trains multiple models on random subsets of data and averages their predictions.

Semi-Supervised Learning

Advanced Methods

A learning approach that combines a small amount of labelled data with a large amount of unlabelled data during training.

Overfitting

Training Techniques

When a model learns the training data too well, including noise, resulting in poor performance on unseen data.

Decision Tree

Supervised Learning

A tree-structured model where internal nodes represent feature tests, branches represent outcomes, and leaves represent predictions.

Polynomial Regression

Supervised Learning

A form of regression analysis where the relationship between variables is modelled as an nth degree polynomial.

Machine Learning

MLOps & Production

A subset of AI that enables systems to automatically learn and improve from experience without being explicitly programmed.

Lasso Regression

Feature Engineering & Selection

A regularised regression technique that adds an L1 penalty, enabling feature selection by driving some coefficients to zero.

Gradient Boosting

Supervised Learning

An ensemble technique that builds models sequentially, with each new model correcting residual errors of the combined ensemble.