Lumbermark detects clusters by iteratively chopping large limbs off a mutual reachability MST, yielding partitions of user-specified sizes as a robust alternative to HDBSCAN.
Asingle-treealgorithmtocomputetheEuclideanminimumspanningtreeonGPUs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Lumbermark: Resistant Clustering by Chopping Up Mutual Reachability Minimum Spanning Trees
Lumbermark detects clusters by iteratively chopping large limbs off a mutual reachability MST, yielding partitions of user-specified sizes as a robust alternative to HDBSCAN.