From d1fd3ca6e1201835c8f64e0e414e65d00dc3e980 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Samuel=20Padr=C3=B3n?= <54023825+samuelpadron@users.noreply.github.com> Date: Wed, 12 Nov 2025 23:37:38 +0100 Subject: [PATCH] Fix typo in "How HDBSCAN Works" page Fixed a minor typo (repeated "a") in the "Build the cluster hierarchy" section of the "How HDBSCAN Works" page. --- docs/how_hdbscan_works.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/how_hdbscan_works.rst b/docs/how_hdbscan_works.rst index a6049a7f..b01bc4cb 100644 --- a/docs/how_hdbscan_works.rst +++ b/docs/how_hdbscan_works.rst @@ -257,7 +257,7 @@ data structure. We can view the result as a dendrogram as we see below: This brings us to the point where robust single linkage stops. We want more though; a cluster hierarchy is good, but we really want a set of -flat clusters. We could do that by drawing a a horizontal line through +flat clusters. We could do that by drawing a horizontal line through the above diagram and selecting the clusters that it cuts through. This is in practice what `DBSCAN `__