liveBook · Manning

Dimensionality reduction

Also called dimension reduction

Dimensionality reduction transforms data into a representation with fewer dimensions while attempting to retain relevant information or structure.

How 15 Manning books explain it

Data Without Labels

Dimensionality reduction is the transformation of data into fewer dimensions while retaining important structure or information.

How it is used
Prepares high-dimensional data for visualization, clustering, and machine-learning models by reducing variables or transforming them into fewer components.
How deep it goes
Works through manual choices and a Python SVD workflow, including cleaning, scaling, explained variance, and plotting; places supporting matrix mathematics in an appendix.
Examples
Uses retail transaction ratios, rainfall predictors, subscriber attributes, and an encoded mushroom dataset with explained-variance and class-colored plots.
What you can do after
Apply it via NumPy SVD and data-preparation tools to inspect explained variance and visualize a lower-dimensional dataset.

Read how Data Without Labels explains dimensionality reduction →

Math and Architectures of Deep Learning

The reduction of the effective number of dimensions in a representation by a transformation such as a singular weight matrix.

How it is used
Uses PCA or learned latent vectors to simplify feature representations while preserving their main information.
How deep it goes
Derives geometric PCA intuition, recaps its SVD workflow, and implements projection and approximate reconstruction in PyTorch.
Examples
Illustrates correlated document terms, 2D points near a line, 3D points near a plane, and synthetic correlated versus uncorrelated data.
What you can do after
Apply it via PyTorch by centering data, using SVD, selecting principal directions, projecting inputs, and reconstructing approximations.

Read how Math and Architectures of Deep Learning explains dimensionality reduction →

Build AI Drug Discovery Pipelines

Dimensionality reduction is the transformation of data into fewer dimensions while retaining important information.

How it is used
Supports representative molecular data splitting and visualization of screening data for drug repurposing.
How deep it goes
Explains PCA through variance, coordinate transformation, standardization, component selection, and a sample-selection workflow; names other methods without detailing them.
Examples
Uses RNA-target molecular descriptors for representative splitting and COVID Moonshot Morgan fingerprints for screening analysis.
What you can do after
Operate/configure PCA with feature standardization and a component-retention setting in a representative sample-selection workflow.

Read how Build AI Drug Discovery Pipelines explains dimensionality reduction →

Natural Language Processing in Action, Second Edition

Dimension reduction is the transformation of data into a representation with fewer features or dimensions while retaining relevant information.

How it is used
Uses reduction to make high-dimensional data manageable for topic modeling, visualization, and embedding storage.
How deep it goes
Explains the intuition and practical motivations, then identifies PCA for storage without detailing its implementation.
Examples
Illustrates reduction with a sofa’s shadow, topic vectors, and the merging of house and houses through stemming.
What you can do after
Evaluate and understand when fewer dimensions help and what information or search precision may be lost.

Read how Natural Language Processing in Action, Second Edition explains dimensionality reduction →

Outlier Detection in Python

Dimensionality reduction is the transformation of data into fewer dimensions while retaining relevant information.

How it is used
Uses fewer dimensions to make many-feature outlier detection more tractable and enable low-dimensional visualization.
How deep it goes
Works through PCA transformations and timed detector comparisons, but does not develop the internals of t-SNE, UMAP, or auto-encoders.
Examples
Tests correlated and independent 100,000-row datasets with planted outliers, PCA component subsets, and six PyOD detectors.
What you can do after
Apply it via scikit-learn PCA and PyOD detectors, comparing outlier ranks and runtime before choosing components.

Read how Outlier Detection in Python explains dimensionality reduction →

Grokking Machine Learning

A technique that simplifies data by reducing or combining features while preserving as much information as possible.

How it is used
Simplifies data by combining similar features, sometimes as preprocessing before supervised learning.
How deep it goes
Defines feature reduction and illustrates fewer columns, but does not detail an algorithm.
Examples
Uses a housing dataset with many features to illustrate reducing features while retaining much of the information.
What you can do after
Understand how reducing columns can simplify a dataset while retaining much of its information.

Read how Grokking Machine Learning explains dimensionality reduction →

Graph Neural Networks in Action

Dimensionality reduction is the transformation of data into a representation with fewer numerical dimensions while retaining selected information or structure.

How it is used
Uses fewer dimensions to visualize graph embeddings and expose patterns for clustering or classification.
How deep it goes
Explains projection workflows, direct 2D alternatives, and autoencoder latent spaces, but defers technical theory and mathematical derivations.
Examples
Demonstrates Political Books embeddings, UMAP plots, direct two-dimensional Node2Vec, synthetic data, and graph autoencoder representations.
What you can do after
Apply it via UMAP or Node2Vec to create two-dimensional embedding visualizations and interpret relative clustering.

Read how Graph Neural Networks in Action explains dimensionality reduction →

Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI

Dimensionality reduction transforms data with many variables into a lower-dimensional representation while attempting to preserve important structure or information.

How it is used
Uses lower-dimensional projections to validate tabular data and visually identify patterns, clusters, and anomalies.
How deep it goes
Explains projection choices, preprocessing, plotting, and interpretation caveats, but stops short of mathematical derivations.
Examples
Demonstrates a two-dimensional t-SNE scatter plot built from numeric and ordinal tabular features.
What you can do after
Diagnose patterns and anomalies by generating and interpreting low-dimensional exploratory plots.

Read how Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI explains dimensionality reduction →

Grokking Machine Learning, Second Edition

A data-transformation technique that reduces the number of features or dimensions while preserving as much relevant information as possible.

How it is used
Uses unlabeled data to simplify features before applying other machine learning techniques.
How deep it goes
Explains feature grouping, dimensions, and related algorithms, but stops short of implementation details or mathematical procedures.
Examples
Uses housing features, similarity grouping, movie recommendations, and black-and-white image compression as examples.
What you can do after
Apply it as preprocessing to simplify datasets, reduce storage or processing demands, and retain much of their information.

Read how Grokking Machine Learning, Second Edition explains dimensionality reduction →

Cyber Threat Hunting

Dimensionality reduction transforms data into a representation with fewer features while retaining important information.

How it is used
Prepares correlated features for supervised machine-learning models and makes reduced data easier to visualize.
How deep it goes
Explains PCA operationally through scaling, variance-based component selection, transformation, and two-dimensional plots, while deferring mathematics.
Examples
Uses DNS-derived FQDN features, Pearson-correlation heat maps, four principal components, and class-colored PC1–PC2 and PC3–PC4 plots.
What you can do after
Apply it via scikit-learn by scaling training features, selecting components from explained variance, and transforming data with PCA.

Read how Cyber Threat Hunting explains dimensionality reduction →

Graph Algorithms for Data Science

Dimensionality reduction is a technique that represents data with fewer numerical dimensions while preserving selected structure or information.

How it is used
Supports automatic node representation and downstream machine-learning tasks.
How deep it goes
Explains feature compression through BMI and introduces node embeddings, but stops short of detailed algorithm internals.
Examples
Uses BMI, obesity assessment, adjacency matrices, and node2vec embeddings as concrete examples.
What you can do after
Apply it via node embedding models to produce compact node vectors for downstream machine-learning tasks.

Read how Graph Algorithms for Data Science explains dimensionality reduction →

Delivering Machine Learning Projects: From design to deployment

Dimensionality reduction is the transformation of data into fewer dimensions while attempting to preserve informative structure.

How it is used
Supports exploratory analysis of unstructured data by making embedding distributions and relationships easier to inspect.
How deep it goes
Explains the visualization workflow and information-loss risk, but does not develop the underlying algorithms mathematically.
Examples
Uses embedded Shakespeare sentences, FAISS neighbor queries, and heatmaps comparing plays.
What you can do after
Evaluate unstructured-data structure by projecting embeddings or querying their nearest neighbors.

Read how Delivering Machine Learning Projects: From design to deployment explains dimensionality reduction →

Human-in-the-Loop Machine Learning: Active learning and annotation for human-centered AI

Dimensionality reduction is the process of representing data with fewer dimensions while retaining relevant information.

How it is used
Reduces feature dimensions to support clustering within diversity sampling.
How deep it goes
Compares PCA and learned representations, then outlines cluster-based distillation; PCA implementation is outside scope.
Examples
Uses cluster labels and hidden-layer features, suggesting a 128-neuron text layer or a CNN for images.
What you can do after
Apply model distillation by clustering high-dimensional items, training a cluster classifier, and reusing its hidden layer as features.

Read how Human-in-the-Loop Machine Learning: Active learning and annotation for human-centered AI explains dimensionality reduction →

Retrieval Augmented Generation, The Foundational Ideas

Dimensionality reduction is the transformation of high-dimensional data into a lower-dimensional representation while retaining selected structure or information.

How it is used
Prepares high-dimensional embeddings for clustering in hierarchical retrieval.
How deep it goes
Explains distance failure, graph-based compression, structure preservation, and n_neighbors tradeoffs, then demonstrates implementation.
Examples
Uses text-embedding-3-small vectors, leaf chunks, UMAP, Gaussian mixture models, and recursive cluster summaries.
What you can do after
Build it from scratch with Python, UMAP, scikit-learn, LangChain, and umap-learn.

Read how Retrieval Augmented Generation, The Foundational Ideas explains dimensionality reduction →

Inside Deep Learning: Math, Algorithms, Models

The process of mapping data from a higher-dimensional space into a lower-dimensional representation while retaining important structure.

How it is used
Maps feature vectors into lower-dimensional representations for feature engineering, with PCA and autoencoders as approaches.
How deep it goes
Recasts PCA through encoder-decoder equations, shared weights, squared-error reconstruction, and a constraint penalty.
Examples
Uses PCA for lower-dimensional mapping and a narrowing encoder with an expanding decoder as a neural-network design.
What you can do after
Understand PCA as a bottleneck autoencoder and compare it with deeper networks that learn more complex mappings.

Read how Inside Deep Learning: Math, Algorithms, Models explains dimensionality reduction →

Also covered in

What to know first

Related concepts

Questions about dimensionality reduction

What is dimensionality reduction?

Dimensionality reduction transforms data into a representation with fewer dimensions while attempting to retain relevant information or structure.

Which Manning books explain dimensionality reduction?

Data Without Labels, Math and Architectures of Deep Learning, Build AI Drug Discovery Pipelines, Natural Language Processing in Action, Second Edition, Outlier Detection in Python, Grokking Machine Learning, Graph Neural Networks in Action, Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI and 7 more.

What should I know before learning dimensionality reduction?

Manning books that teach dimensionality reduction usually introduce language model, principal component analysis, curse of dimensionality and supervised learning first.

What kinds of dimensionality reduction are there?

Kinds of dimensionality reduction include principal component analysis, t-SNE, UMAP and supervised dimensionality reduction.

What is dimensionality reduction a kind of?

Dimensionality reduction is a kind of unsupervised learning. Unsupervised learning is a machine-learning approach that discovers patterns, structure, or representations in data without labeled target outputs.

What is dimensionality reduction also called?

Dimensionality reduction is also called dimension reduction.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.