1248 search results - page 14 / 250 » Decision Tree Grafting |
COLT
2003
Springer
15 years 5 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
PAAPP
2006
14 years 11 months ago
2006
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
105
click to vote
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
IJCAI
1993
15 years 1 months ago
1993
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to nd a good ob...
102
click to vote
COLING
1996
15 years 1 months ago
1996
The Decision Tree Learning Algorithms (DTLAs) are getting keen attention from the natural language processing research comlnunity, and there have been a series of attempts to appl...