liveBook · Manning

DBSCAN

Also called Density-based spatial clustering

DBSCAN is a density-based clustering algorithm that groups observations in dense regions and identifies observations in lower-density regions as noise or outliers.

How 4 Manning books explain it

Advanced Algorithms and Data Structures

DBSCAN is a density-based clustering algorithm that identifies dense regions and separates them from lower-density points using neighborhood and density parameters.

How it is used
Groups unlabeled points by density while identifying noise, including in customer-segmentation scenarios.
How deep it goes
Develops reachability definitions into a cluster-expansion algorithm, implementation, range-query costs, limitations, and a distributed variant.
Examples
Uses core-point diagrams, cluster-growth steps, concentric rings under different ε values, and expanded grid shards.
What you can do after
Build it from scratch using neighborhood queries and cluster expansion, then evaluate parameter and indexing trade-offs.

Read how Advanced Algorithms and Data Structures explains DBSCAN →

Data Without Labels

DBSCAN is a density-based clustering algorithm that identifies dense regions and labels sufficiently isolated points as noise.

How it is used
Finds dense customer or other data segments without a predefined cluster count while distinguishing outliers.
How deep it goes
Defines ε, minPts, and point categories, then works through parameter inspection, fitting, labels, and plotting in Python.
Examples
Uses standardized features, a nearest-neighbor distance plot, and cluster plots; proposes iris and online retail exercises.
What you can do after
Apply it via scikit-learn to fit DBSCAN, inspect cluster labels, and compare groupings with a business or dataset goal.

Read how Data Without Labels explains DBSCAN →

Outlier Detection in Python

DBSCAN is a density-based clustering algorithm that forms clusters from regions of sufficiently dense observations and can leave some observations unclustered.

How it is used
Uses density-discovered clusters to flag unclustered observations during outlier detection.
How deep it goes
Covers preprocessing, fitting, label conversion, visualization, and eps sensitivity, without developing detailed density theory.
Examples
Uses wall-robot-navigation, baseball, and JM1 datasets with two-feature plots, scaled features, and repeated-eps scores.
What you can do after
Apply it via scikit-learn to flag unclustered rows and compare results across eps settings.

Read how Outlier Detection in Python explains DBSCAN →

Grokking Machine Learning, Second Edition

DBSCAN is a density-based clustering algorithm that forms groups in dense regions and identifies isolated points as noise.

How it is used
Identifies dense groups and labels isolated observations as noise during unsupervised clustering.
How deep it goes
Defines density-based grouping and noise labeling, but stops short of parameters, procedure, implementation, and worked output.
Examples
Uses an email dataset plotted by message size and recipient count, showing three visible clusters.
What you can do after
Evaluate/understand how DBSCAN groups dense regions and treats isolated points as noise.

Read how Grokking Machine Learning, Second Edition explains DBSCAN →

Also covered in

What to know first

Related concepts

Questions about DBSCAN

What is DBSCAN?

DBSCAN is a density-based clustering algorithm that groups observations in dense regions and identifies observations in lower-density regions as noise or outliers.

Which Manning books explain DBSCAN?

Advanced Algorithms and Data Structures, Data Without Labels, Outlier Detection in Python and Grokking Machine Learning, Second Edition.

What should I know before learning DBSCAN?

Manning books that teach DBSCAN usually introduce K-means clustering, supervised learning, anomaly detection and artificial intelligence first.

What is the difference between DBSCAN and HDBSCAN?

DBSCAN is a density-based clustering algorithm that groups observations in dense regions and identifies observations in lower-density regions as noise or outliers. HDBSCAN is a hierarchical density-based clustering algorithm that identifies clusters with varying densities and can label noise points without requiring a fixed cluster count.

What is DBSCAN a kind of?

DBSCAN is a kind of hard clustering. Hard clustering assigns each observation to at most one cluster, with all clusters represented at the same hierarchy level.

What is DBSCAN also called?

DBSCAN is also called Density-based spatial clustering.

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.