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.
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.
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.
Related concepts
- hard clusteringkind of · Hard clustering assigns each observation to at most one cluster, with all clusters represented at the same hierarchy level.
- clusteringkind of · Clustering is the technique of grouping data items according to similarity or shared characteristics.
- epsconfigured by · Eps is a numeric parameter or constant whose specific meaning depends on the method, often representing a tolerance, smoothing value, neighborhood radius, or floating-point precision.
- K-means clusteringcontrasts with · K-means clustering partitions data into a specified number of groups by assigning observations to representative centers and iteratively updating those centers to reduce within-group distances.
- range queryuses · A range query retrieves values or objects satisfying a specified interval, comparison, distance, or spatial-boundary condition.
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.