219 search results - page 13 / 44 » Optimal dyadic decision trees |
KDD
2009
ACM
14 years 11 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
PODS
2010
ACM
14 years 3 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
AAAI
2006
13 years 11 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
AIPS
2011
13 years 2 months ago
2011
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
ICANN
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. This paper presents a neural network tree regression system with dynamic optimization of input variable transformations and post-training optimization. The decision tree ...