Sciweavers

272 search results - page 2 / 55
» Lazy tree splitting
Sort
View
CSDA
2004
81views more  CSDA 2004»
13 years 5 months ago
A note on split selection bias in classification trees
A common approach to split selection in classification trees is to search through all possible splits generated by predictor variables. A splitting criterion is then used to evalu...
Y.-S. Shih
STACS
1999
Springer
13 years 9 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 12 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
IJCAI
2001
13 years 6 months ago
Temporal Decision Trees or the lazy ECU vindicated
The automatic generation of diagnostic decision trees from qualitative models is a reasonable compromise between the advantages of using a modelbased approach in technical domains...
Luca Console, Claudia Picardi, Daniele Theseider D...
PAAPP
2006
85views more  PAAPP 2006»
13 years 5 months ago
A new metric splitting criterion for decision trees
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
Dan A. Simovici, Szymon Jaroszewicz