A Metric for HDBSCAN-Generated Clusters

How can we determine the equivalent DBSCAN ε parameter for HDBSCAN-generated clusters?

The image above depicts the minimum spanning tree of distances in an HDBSCAN-generated cluster. Image by the author made with the Folium package and OpenStreetMap imagery.

HDBSCAN is a hierarchical density-based clustering algorithm that works under simple assumptions. At a minimum, it only requires the data points to cluster and the minimum number of observations per cluster. The algorithm accepts a distance matrix if the data has a …

clustering generated hdbscan minimum-spanning-tree towards-data-science