DBSCAN Density Clustering
Grow clusters through dense neighborhoods while separating border points from noise.
Free theory articleGrow clusters through dense neighborhoods while separating border points from noise.
Concept & interpretation
Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a foundational algorithm for finding nonconvex clusters. Unlike centroid-based methods (such as k-means) that assume spherical clusters, DBSCAN groups points based on local density, allowing it to discover clusters of arbitrary shapes while robustly identifying outliers as noise.
Interactive Clustering Explorer
Observe how the DBSCAN algorithm classifies points dynamically based on your parameter choices. The visualization shows a set of points: (0,0), (0.1,0), (0.2,0), (2,0), (2.1,0), and (5,0). Adjust the Epsilon and Minimum points controls to see how neighborhoods overlap and clusters merge or break apart.
Follow these instructions to observe the algorithm in action:
- Select 0.15 for the Epsilon control.
- Select 2 for the Minimum points control.
- Observe that the closely packed points form distinct clusters, while the isolated point at (5,0) is correctly identified as noise.
- Change the Minimum points control to 3.
- Observe some previously valid clusters break down into noise because the local density is no longer sufficient.
You can also visit the live module at https://riano.app/module/dbscan-density-clustering.