272 search results - page 5 / 55 » Lazy tree splitting |
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
BICOB
2010
Springer
13 years 6 months ago
2010
Springer
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...
ICML
1990
IEEE
13 years 11 months ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...