Lumbermark Beats HDBSCAN and k-means on 61 Clustering Benchmarks
A new divisive clustering algorithm chops up mutual reachability spanning trees to detect clusters of varying densities, shapes, and sizes while beating HDBSCAN and Genie on benchmarks.
Source
AlphaSignal
Published
Author
AlphaSignal Newsroom
Read
1 min read
A new divisive clustering algorithm chops up mutual reachability spanning trees to detect clusters of varying densities, shapes, and sizes while beating HDBSCAN and Genie on benchmarks.
Reporting is indexed from AlphaSignal. Rights remain with the original publisher and cited sources.
