DBSCAN
DBSCAN (Density-Based Spatial Clustering of Applications with Noise) is an unsupervised clustering algorithm that groups densely packed points together while labeling isolated points as noise. It excels at discovering clusters of arbitrary shape without requiring the number of clusters to be specified in advance.
DBSCAN is a density-based clustering algorithm introduced by Martin Ester and colleagues in 1996. Unlike partitioning methods such as k-means, DBSCAN defines clusters as contiguous regions of high point density separated by regions of lower density. The algorithm requires two parameters: epsilon (eps), the maximum distance between two points to be considered neighbors, and minPts, the minimum number of points required to form a dense region.
Algorithm Mechanics
DBSCAN classifies each point as a core point, border point, or noise point. A core point has at least minPts neighbors within its eps-neighborhood. A border point falls within the eps-neighborhood of a core point but does not itself meet the minPts threshold. A noise point is neither core nor border. The algorithm iteratively expands clusters from core points by visiting their eps-neighbors and recursively including any newly discovered core points, forming arbitrarily shaped clusters.
Spatial Applications
In GISGISGeographic Information Systems (GIS) enable users to analyze and visualize spatial data to uncover patterns, relation..., DBSCAN is applied to identify geographic clusters in point datasets such as crime incidents, GPSGPSThe Global Positioning System (GPS) is a satellite-based navigation system operated by the U.S. Space Force that prov... trajectories, species sightings, and social media check-ins. Urban analysts use it to detect activity centers from mobile phone data, while environmental scientists cluster pollution measurements to delineate contaminated zones. Retail analysts group customer locations to identify trade area cores, and transportation planners detect congestion hotspots from vehicle probe data.
Strengths and Limitations
DBSCAN requires no prior knowledge of the number of clusters and naturally handles noise. It discovers clusters of arbitrary shapes, outperforming k-means on non-convex patterns. However, it struggles when clusters have widely varying densities, as a single eps value cannot accommodate all clusters simultaneously. Variants like HDBSCAN and OPTICS address this limitation by adapting density thresholds.
Ready?
See Mapular
in Action.
Book a free 30-minute demo. We'll show you exactly how the platform works for your use case — no generic slides, no obligation.