Sciweavers

82 search results - page 2 / 17
» Lookahead-based algorithms for anytime induction of decision...
Sort
View
NIPS
2007
13 years 9 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
ICTAI
1999
IEEE
13 years 12 months ago
Controlled Flux Results in Stable Decision Trees
This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillat...
Dimitrios Kalles, Athanassios Papagelis
IPL
2002
98views more  IPL 2002»
13 years 7 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
SGAI
2010
Springer
13 years 5 months ago
Induction of Modular Classification Rules: Using Jmax-pruning
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...
Frederic T. Stahl, Max Bramer
IDA
2000
Springer
13 years 7 months ago
Induction of decision trees in numeric domains using set-valued attributes
Conventional algorithms for decision tree induction use an attribute-value representation scheme for instances. This paper explores the empirical consequences of using set-valued ...
Dimitrios Kalles, Athanassios Papagelis, Eirini Nt...