Sciweavers

258 search results - page 2 / 52
» Improving Stability of Decision Trees
Sort
View
AAAI
2006
14 years 11 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
ICML
2003
IEEE
15 years 10 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
ECCC
2010
108views more  ECCC 2010»
14 years 7 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
CEC
2010
IEEE
14 years 10 months ago
Improving GP classification performance by injection of decision trees
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 ...
Rikard König, Ulf Johansson, Tuve Löfstr...
DATAMINE
2010
166views more  DATAMINE 2010»
14 years 9 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont