510 search results - page 3 / 102 » Complexity measures and decision tree complexity: a survey |
TAPSOFT
1987
Springer
13 years 9 months ago
1987
Springer
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
RSCTC
2000
Springer
13 years 9 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
ICML
1999
IEEE
14 years 6 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
DLT
2003
13 years 7 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...