Sciweavers

583 search results - page 7 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
89
Voted
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
IPL
2002
98views more  IPL 2002»
14 years 9 months ago
Evolutionary induced decision trees for dangerous software modules prediction
We study the possibility of constructing decision trees with evolutionary algorithms in order to increase their predictive accuracy. We present a self-adapting evolutionary algori...
Vili Podgorelec, Peter Kokol
ICML
2004
IEEE
15 years 10 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
90
Voted
ML
2008
ACM
135views Machine Learning» more  ML 2008»
14 years 9 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget