Repository navigation
Commit 68ba517
Spread the regular HDBSCAN cases over distinct data situations
The four datasets in the regular config were picked for size, which left two
near-duplicate pairs. Each now covers a different regime:
* kd_tree, skin_segmentation 100000 x 3 -- real, discrete, duplicate-heavy, so
low dimension with thousands of small clusters and a tie-dense mutual
reachability graph.
* kd_tree, make_blobs 100000 x 8 with 100 centers (was 16 features, 10 centers)
-- many well-separated clusters, which moves the cost into the condensed tree
and the cluster selection instead of the neighbors search. Also no longer a
subset of the weekly sweep, which covers 10 centers at 4 / 16 / 64 features.
* brute, mnist 20000 x 784 -- high dimension, where the pairwise distance
computation dominates.
* brute, make_blobs 25000 x 4 (was 256 features) -- the opposite brute-force
regime: the distance computation is negligible and the passes over the n^2
matrix dominate.
Still 8 cases. Verified end to end against stock scikit-learn: 345.8x, 176.7x,
5.2x and 5.7x respectively, with matching cluster counts and Davies-Bouldin
scores.
Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>1 parent f2a8edd commit 68ba517
1 file changed
Lines changed: 5 additions & 5 deletions
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
11 | 11 | | |
12 | 12 | | |
13 | 13 | | |
14 | | - | |
| 14 | + | |
15 | 15 | | |
16 | | - | |
17 | | - | |
| 16 | + | |
| 17 | + | |
18 | 18 | | |
19 | 19 | | |
20 | 20 | | |
| |||
32 | 32 | | |
33 | 33 | | |
34 | 34 | | |
35 | | - | |
36 | | - | |
| 35 | + | |
| 36 | + | |
37 | 37 | | |
38 | 38 | | |
39 | 39 | | |
| |||
0 commit comments