507 search results - page 6 / 102 » Sizes of Ordered Decision Trees |
FLAIRS
2006
13 years 9 months ago
2006
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...
ECML
2004
Springer
14 years 1 months ago
2004
Springer
This paper 3 proposes a new method to qualify the result given by a decision tree when it is used as a decision aid system. When the data are numerical, we compute the distance of ...
PIMRC
2008
IEEE
14 years 2 months ago
2008
IEEE
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
CPC
2004
13 years 7 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
ML
2000
ACM
13 years 7 months ago
2000
ACM
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...