FOSC-X uses bounded dynamic programming to compute top-M optimal non-horizontal cuts from clustering hierarchies in linear time, with or without cluster-count constraints.
What are the true clusters? Pattern Recognition Letters 64, 53–62
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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.
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.