liveBook · Manning

Singular value decomposition

As explained in Grokking Machine Learning

A matrix decomposition that expresses a matrix as the product of orthogonal matrices and a diagonal matrix of singular values.

Singular value decomposition is a way to simplify a large data matrix by expressing it as a product of smaller matrices, reducing both its rows and columns. section 2.3 section 2.5

Clustering can reduce a dataset’s rows, while dimensionality reduction can reduce its columns; SVD is presented as a way to simplify both at once. section 2.3 section 2.5

Image compression

Treat a black-and-white image as a table whose entries are pixel intensities. Singular value decomposition is used in image compression. section 2.3

How Grokking Machine Learning covers it

How deep it goes
Explains the smaller-matrix idea and names an application, but gives no decomposition procedure.
Examples
Uses a black-and-white image represented by pixel intensities to illustrate image compression.
What you can do after
Understand how SVD can simplify a data matrix and support image compression.
How it connects
Connects singular value decomposition with matrix factorization, dimensionality reduction, and unsupervised learning.

Also explained in

Compare how 6 books explain singular value decomposition →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Grokking Machine Learning. The section links point to the parts of the book it draws on.