We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
Abstract— Decision trees, being human readable and hierarchically structured, provide a suitable mean to derive state-space abstraction and simplify the inclusion of the availabl...
Masoud Asadpour, Majid Nili Ahmadabadi, Roland Sie...
We propose an omnivariate decision tree architecture which contains univariate, multivariate linear or nonlinear nodes, matching the complexity of the node to the complexity of the...
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...