DBSCAN Density-Based Clustering

hard
Unit 19 · Trees & Boosting0/0 to milestone

k-means needs you to choose kk and assumes round clusters. DBSCAN finds clusters of any shape and labels outliers as noise, using just two parameters: a radius eps and min_samples.

Pro problem

Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.

Start 7-day free trial
solution.py · Python 3.13
Run your code to see results. ⌘↵ to run · ⌘⇧↵ to submit
DBSCAN Density-Based Clustering · TechGradify