A novel algorithm learns sets of optimal quantile regression trees to predict full conditional distributions interpretably and efficiently.
Commu- nications of the ACM63(1), 68–77 (2019)
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
-
Interpretable Quantile Regression by Optimal Decision Trees
A novel algorithm learns sets of optimal quantile regression trees to predict full conditional distributions interpretably and efficiently.