For any function computable by an optimal decision tree with size s, max depth D_opt and average depth Δ_opt, the greedy heuristic builds an ε-approximating tree of size at most exp(Δ_opt D_opt log(e/ε)) under arbitrary product distributions.
Proceedings of the AAAI Conference on Artificial Intelligence , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Decision Tree Learning on Product Spaces
For any function computable by an optimal decision tree with size s, max depth D_opt and average depth Δ_opt, the greedy heuristic builds an ε-approximating tree of size at most exp(Δ_opt D_opt log(e/ε)) under arbitrary product distributions.