507 search results - page 7 / 102 » Sizes of Ordered Decision Trees |
101
click to vote
COCO
2006
Springer
15 years 1 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...
101
click to vote
ISBMS
2010
Springer
15 years 6 hour ago
2010
Springer
We analyze a problem, which is relevant for physiological modeling of vascular networks: the initialization and optimization of specific, individual models of a functioning vessel ...
STOC
1992
ACM
15 years 2 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
UM
2001
Springer
15 years 2 months ago
2001
Springer
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...