DBSCAN groups data points in dense regions and labels isolated points as noise. It offers a way to find clusters without assigning every point to a group. section 2.11
DBSCAN belongs to a family of clustering approaches:
- K-means moves randomly chosen centers toward nearby points. section 2.11
- Hierarchical clustering progressively joins nearby points. section 2.11
- Gaussian mixture models assign fractional membership across clusters. section 2.11
Figure 2.5 A plot of the email dataset. The horizontal axis corresponds to the size of the email and the vertical axis to the number of recipients. We can see three well-defined clusters in this dataset.
Inspect email size and recipient count as a concrete clustering dataset with three visible groups. section 2.11



