Today, I learned when and how to use Denisty-Based Spatial Clustering for Applications with Noise, or DBSCAN. Using a clustering algorithm, it is possible to locate densely packed groups of data points in a space. Unlike with k-means, we don’t really need to specify the number of clusters in advance. It is able to find collections of arbitrary shapes.
