Part of a series on |

Machine learning and data mining |
---|

**Density-based spatial clustering of applications with noise** (**DBSCAN**) is a data clustering algorithm proposed by Martin Ester, Hans-Peter Kriegel, Jörg Sander and Xiaowei Xu in 1996.^{[1]}
It is a density-based clustering non-parametric algorithm: given a set of points in some space, it groups together points that are closely packed together (points with many nearby neighbors), marking as outliers points that lie alone in low-density regions (whose nearest neighbors are too far away).
DBSCAN is one of the most common clustering algorithms and also most cited in scientific literature.^{[2]}

In 2014, the algorithm was awarded the test of time award (an award given to algorithms which have received substantial attention in theory and practice) at the leading data mining conference, ACM SIGKDD.^{[3]} As of July 2020^{[update]}, the follow-up paper "DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN"^{[4]} appears in the list of the 8 most downloaded articles of the prestigious ACM Transactions on Database Systems (TODS) journal.^{[5]}

In 1972, Robert F. Ling published a closely related algorithm in "The Theory and Construction of k-Clusters"^{[6]} in *The Computer Journal* with an estimated runtime complexity of O(n³).^{[6]} DBSCAN has a worst-case of O(n²), and the database-oriented range-query formulation of DBSCAN allows for index acceleration. The algorithms slightly differ in their handling of border points.

Consider a set of points in some space to be clustered. Let ε be a parameter specifying the radius of a neighborhood with respect to some point. For the purpose of DBSCAN clustering, the points are classified as *core points*, (*directly*-)* reachable points* and *outliers*, as follows:

- A point p is a
*core point*if at least minPts points are within distance ε of it (including p). - A point q is
*directly reachable*from p if point q is within distance ε from core point p. Points are only said to be directly reachable from core points. - A point q is
*reachable*from p if there is a path*p*_{1}, ...,*p*with_{n}*p*_{1}=*p*and*p*=_{n}*q*, where each*p*_{i+1}is directly reachable from p_{i}. Note that this implies that the initial point and all points on the path must be core points, with the possible exception of q. - All points not reachable from any other point are
*outliers*or*noise points*.

Now if p is a core point, then it forms a *cluster* together with all points (core or non-core) that are reachable from it. Each cluster contains at least one core point; non-core points can be part of a cluster, but they form its "edge", since they cannot be used to reach more points.

Reachability is not a symmetric relation: by definition, only core points can reach non-core points. The opposite is not true, so a non-core point may be reachable, but nothing can be reached from it. Therefore, a further notion of *connectedness* is needed to formally define the extent of the clusters found by DBSCAN. Two points p and q are density-connected if there is a point o such that both p and q are reachable from o. Density-connectedness *is* symmetric.

A cluster then satisfies two properties:

- All points within the cluster are mutually density-connected.
- If a point is density-reachable from some point of the cluster, it is part of the cluster as well.

DBSCAN requires two parameters: ε (eps) and the minimum number of points required to form a dense region^{[a]} (minPts). It starts with an arbitrary starting point that has not been visited. This point's ε-neighborhood is retrieved, and if it contains sufficiently many points, a cluster is started. Otherwise, the point is labeled as noise. Note that this point might later be found in a sufficiently sized ε-environment of a different point and hence be made part of a cluster.

If a point is found to be a dense part of a cluster, its ε-neighborhood is also part of that cluster. Hence, all points that are found within the ε-neighborhood are added, as is their own ε-neighborhood when they are also dense. This process continues until the density-connected cluster is completely found. Then, a new unvisited point is retrieved and processed, leading to the discovery of a further cluster or noise.

DBSCAN can be used with any distance function^{[1]}^{[4]} (as well as similarity functions or other predicates).^{[7]} The distance function (dist) can therefore be seen as an additional parameter.

The algorithm can be expressed in pseudocode as follows:^{[4]}

DBSCAN(DB, distFunc, eps, minPts) { C := 0/* Cluster counter */for eachpoint Pindatabase DB {iflabel(P) ≠ undefinedthencontinue/* Previously processed in inner loop */Neighbors N := RangeQuery(DB, distFunc, P, eps)/* Find neighbors */if|N| < minPtsthen{/* Density check */label(P) := Noise/* Label as Noise */continue} C := C + 1/* next cluster label */label(P) := C/* Label initial point */SeedSet S := N \ {P}/* Neighbors to expand */for eachpoint QinS {/* Process every seed point Q */iflabel(Q) = Noisethenlabel(Q) := C/* Change Noise to border point */iflabel(Q) ≠ undefinedthencontinue/* Previously processed (e.g., border point) */label(Q) := C/* Label neighbor */Neighbors N := RangeQuery(DB, distFunc, Q, eps)/* Find neighbors */if|N| ≥ minPtsthen{/* Density check (if Q is a core point) */S := S ∪ N/* Add new neighbors to seed set */} } } }

where RangeQuery can be implemented using a database index for better performance, or using a slow linear scan:

RangeQuery(DB, distFunc, Q, eps) { Neighbors N := empty listfor eachpoint Pindatabase DB {/* Scan all points in the database */ifdistFunc(Q, P) ≤ epsthen{/* Compute distance and check epsilon */N := N ∪ {P}/* Add to result */} }returnN }

The DBSCAN algorithm can be abstracted into the following steps:^{[4]}

- Find the points in the ε (eps) neighborhood of every point, and identify the core points with more than minPts neighbors.
- Find the connected components of
*core*points on the neighbor graph, ignoring all non-core points. - Assign each non-core point to a nearby cluster if the cluster is an ε (eps) neighbor, otherwise assign it to noise.

A naive implementation of this requires storing the neighborhoods in step 1, thus requiring substantial memory. The original DBSCAN algorithm does not require this by performing these steps for one point at a time.

DBSCAN visits each point of the database, possibly multiple times (e.g., as candidates to different clusters). For practical considerations, however, the time complexity is mostly governed by the number of regionQuery invocations. DBSCAN executes exactly one such query for each point, and if an indexing structure is used that executes a neighborhood query in O(log *n*), an overall average runtime complexity of O(*n* log *n*) is obtained (if parameter ε is chosen in a meaningful way, i.e. such that on average only O(log *n*) points are returned). Without the use of an accelerating index structure, or on degenerated data (e.g. all points within a distance less than ε), the worst case run time complexity remains O(*n*²). The - *n* = (*n*²-*n*)/2-sized upper triangle of the distance matrix can be materialized to avoid distance recomputations, but this needs O(*n*²) memory, whereas a non-matrix based implementation of DBSCAN only needs O(*n*) memory.

- DBSCAN does not require one to specify the number of clusters in the data a priori, as opposed to k-means.
- DBSCAN can find arbitrarily-shaped clusters. It can even find a cluster completely surrounded by (but not connected to) a different cluster. Due to the MinPts parameter, the so-called single-link effect (different clusters being connected by a thin line of points) is reduced.
- DBSCAN has a notion of noise, and is robust to outliers.
- DBSCAN requires just two parameters and is mostly insensitive to the ordering of the points in the database. (However, points sitting on the edge of two different clusters might swap cluster membership if the ordering of the points is changed, and the cluster assignment is unique only up to isomorphism.)
- DBSCAN is designed for use with databases that can accelerate region queries, e.g. using an R* tree.
- The parameters minPts and ε can be set by a domain expert, if the data is well understood.

- DBSCAN is not entirely deterministic: border points that are reachable from more than one cluster can be part of either cluster, depending on the order the data are processed. For most data sets and domains, this situation does not arise often and has little impact on the clustering result:
^{[4]}both on core points and noise points, DBSCAN is deterministic. DBSCAN*^{[8]}is a variation that treats border points as noise, and this way achieves a fully deterministic result as well as a more consistent statistical interpretation of density-connected components. - The quality of DBSCAN depends on the distance measure used in the function regionQuery(P,ε). The most common distance metric used is Euclidean distance. Especially for high-dimensional data, this metric can be rendered almost useless due to the so-called "Curse of dimensionality", making it difficult to find an appropriate value for ε. This effect, however, is also present in any other algorithm based on Euclidean distance.
- DBSCAN cannot cluster data sets well with large differences in densities, since the minPts-ε combination cannot then be chosen appropriately for all clusters.
^{[9]} - If the data and scale are not well understood, choosing a meaningful distance threshold ε can be difficult.

See the section below on extensions for algorithmic modifications to handle these issues.

Every data mining task has the problem of parameters. Every parameter influences the algorithm in specific ways. For DBSCAN, the parameters ε and *minPts* are needed. The parameters must be specified by the user. Ideally, the value of ε is given by the problem to solve (e.g. a physical distance), and *minPts* is then the desired minimum cluster size.^{[a]}

*MinPts*: As a rule of thumb, a minimum*minPts*can be derived from the number of dimensions*D*in the data set, as*minPts*≥*D*+ 1. The low value of*minPts*= 1 does not make sense, as then every point is a core point by definition. With*minPts*≤ 2, the result will be the same as of hierarchical clustering with the single link metric, with the dendrogram cut at height ε. Therefore,*minPts*must be chosen at least 3. However, larger values are usually better for data sets with noise and will yield more significant clusters. As a rule of thumb,*minPts*= 2·*dim*can be used,^{[7]}but it may be necessary to choose larger values for very large data, for noisy data or for data that contains many duplicates.^{[4]}- ε: The value for ε can then be chosen by using a k-distance graph, plotting the distance to the
*k*=*minPts*-1 nearest neighbor ordered from the largest to the smallest value.^{[4]}Good values of ε are where this plot shows an "elbow":^{[1]}^{[7]}^{[4]}if ε is chosen much too small, a large part of the data will not be clustered; whereas for a too high value of ε, clusters will merge and the majority of objects will be in the same cluster. In general, small values of ε are preferable,^{[4]}and as a rule of thumb only a small fraction of points should be within this distance of each other. Alternatively, an OPTICS plot can be used to choose ε,^{[4]}but then the OPTICS algorithm itself can be used to cluster the data. - Distance function: The choice of distance function is tightly coupled to the choice of ε, and has a major impact on the results. In general, it will be necessary to first identify a reasonable measure of similarity for the data set, before the parameter ε can be chosen. There is no estimation for this parameter, but the distance functions needs to be chosen appropriately for the data set. For example, on geographic data, the great-circle distance is often a good choice.

OPTICS can be seen as a generalization of DBSCAN that replaces the ε parameter with a maximum value that mostly affects performance. *MinPts* then essentially becomes the minimum cluster size to find. While the algorithm is much easier to parameterize than DBSCAN, the results are a bit more difficult to use, as it will usually produce a hierarchical clustering instead of the simple data partitioning that DBSCAN produces.

Recently, one of the original authors of DBSCAN has revisited DBSCAN and OPTICS, and published a refined version of hierarchical DBSCAN (HDBSCAN*),^{[8]} which no longer has the notion of border points. Instead, only the core points form the cluster.

A spectral implementation of DBSCAN is related to spectral clustering in the trivial case of determining connected graph components — the optimal clusters with no edges cut.^{[10]} However, it can be computationally intensive, up to . Additionally, one has to choose the number of eigenvectors to compute. For performance reasons, the original DBSCAN algorithm remains preferable to its spectral implementation.

Generalized DBSCAN (GDBSCAN)^{[7]}^{[11]} is a generalization by the same authors to arbitrary "neighborhood" and "dense" predicates. The ε and *minPts* parameters are removed from the original algorithm and moved to the predicates. For example, on polygon data, the "neighborhood" could be any intersecting polygon, whereas the density predicate uses the polygon areas instead of just the object count.

Various extensions to the DBSCAN algorithm have been proposed, including methods for parallelization, parameter estimation, and support for uncertain data. The basic idea has been extended to hierarchical clustering by the OPTICS algorithm. DBSCAN is also used as part of subspace clustering algorithms like PreDeCon and SUBCLU. HDBSCAN^{[8]} is a hierarchical version of DBSCAN which is also faster than OPTICS, from which a flat partition consisting of the most prominent clusters can be extracted from the hierarchy.^{[12]}

Different implementations of the same algorithm were found to exhibit enormous performance differences, with the fastest on a test data set finishing in 1.4 seconds, the slowest taking 13803 seconds.^{[13]} The differences can be attributed to implementation quality, language and compiler differences, and the use of indexes for acceleration.

- Apache Commons Math contains a Java implementation of the algorithm running in quadratic time.
- ELKI offers an implementation of DBSCAN as well as GDBSCAN and other variants. This implementation can use various index structures for sub-quadratic runtime and supports arbitrary distance functions and arbitrary data types, but it may be outperformed by low-level optimized (and specialized) implementations on small data sets.
- MATLAB includes an implementation of DBSCAN in its "Statistics and Machine Learning Toolbox" since release R2019a.
- mlpack includes an implementation of DBSCAN accelerated with dual-tree range search techniques.
- PostGIS includes ST_ClusterDBSCAN – a 2D implementation of DBSCAN that uses R-tree index. Any geometry type is supported, e.g. Point, LineString, Polygon, etc.
- R contains implementations of DBSCAN in the packages dbscan and fpc. Both packages support arbitrary distance functions via distance matrices. The package fpc does not have index support (and thus has quadratic runtime and memory complexity) and is rather slow due to the R interpreter. The package dbscan provides a fast C++ implementation using k-d trees (for Euclidean distance only) and also includes implementations of DBSCAN*, HDBSCAN*, OPTICS, OPTICSXi, and other related methods.
- scikit-learn includes a Python implementation of DBSCAN for arbitrary Minkowski metrics, which can be accelerated using k-d trees and ball trees but which uses worst-case quadratic memory. A contribution to scikit-learn provides an implementation of the HDBSCAN* algorithm.
- pyclustering library includes a Python and C++ implementation of DBSCAN for Euclidean distance only as well as OPTICS algorithm.
- SPMF includes an implementation of the DBSCAN algorithm with k-d tree support for Euclidean distance only.
- Weka contains (as an optional package in latest versions) a basic implementation of DBSCAN that runs in quadratic time and linear memory.