Proposes the first algorithm for optimal hypersurface decision trees with time complexity O(K! × N^{DG+G}) plus pruning and incremental checks that reduce practical cost.
Random forests
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal hypersurface decision trees
Proposes the first algorithm for optimal hypersurface decision trees with time complexity O(K! × N^{DG+G}) plus pruning and incremental checks that reduce practical cost.