1661 search results - page 24 / 333 » Decision Tree Fields |
98
Voted
ICMLA
2008
15 years 3 months ago
2008
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
160
Voted
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
91
Voted
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree lea...
116
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
116
click to vote
TOG
2008
15 years 1 months ago
2008
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...