DBSCAN Explained Simply: Clustering with Noise and Arbitrary Shapes

Jan 11 · 5 min read · In this article of our Unsupervised Learning series, we explore another important clustering algorithm that comes right after K-Means in popularity and usefulness — DBSCAN. While K-Means works very well for many problems, it assumes that clusters are...