In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
A decision tree induction method for multilabel classification tasks (IS-MLT) is presented which uses an iterative approach for determining the best split at each node. The propo...
While decision trees have been used primarily for classification, they can also model regression or function approximation. Like classification trees, regression trees often yield...
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...