Sciweavers

16430 search results - page 18 / 3286
» On Computable Tree Functions
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
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...
Élisa Fromont, Siegfried Nijssen
CG
2006
Springer
13 years 11 months ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Streaming Tree Transducers
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
Rajeev Alur, Loris D'Antoni