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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
FOSC-X: An Extended Framework for Optimal Local Cuts and Non-Horizontal Cluster Selection from Clustering Hierarchies
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.