1923 search results - page 14 / 385 » Weighted Decision Trees |
IPL
2006
13 years 7 months ago
2006
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
SAC
2000
ACM
14 years 2 days ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
ACTA
2008
13 years 6 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
COLT
2003
Springer
14 years 29 days 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
13 years 7 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...