Expressive tests for classification and regression
We address the problem of computing various types of expressive tests for decision trees and regression trees. Using expressive tests is promising, because it may improve the prediction accuracy of trees, and it may also provide us some hints on scientific discovery. The drawback is that computing an optimal test could be costly. We present a unified framework to approach this problem, and we revisit the design of efficient algorithms for computing important, special cases. We also prove that it is intractable to compute an optimal conjunction or disjunction.
classification regression decision trees