13 search results - page 1 / 3 » Separating Decision Tree Complexity from Subcube Partition C... |
RSCTC
2000
Springer
13 years 8 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 ...
ALDT
2009
Springer
13 years 11 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper presents a novel hybrid method combining genetic programming and decision tree learning. The method starts by estimating a benchmark level of reasonable accuracy, based ...
ICMCS
2006
IEEE
13 years 10 months ago
2006
IEEE
1 In this paper, we introduce and evaluate a low complexity macroblock partition mode decision algorithm for interframe prediction in MPEG-2 to H.264 transcoder. The proposed tools...