Sciweavers

41 search results - page 3 / 9
» Optimizing the Induction of Alternating Decision Trees
Sort
View
JDWM
2007
107views more  JDWM 2007»
13 years 4 months ago
Evolutionary Induction of Mixed Decision Trees
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
Marek Kretowski, Marek Grzes
IEAAIE
1995
Springer
13 years 8 months ago
Polygonal Inductive Generalisation System
Classification learning has been dominated by the induction of axisorthogonal decision surfaces. While induction of alternate forms of decision surface has received some attentio...
Douglas A. Newlands, Geoffrey I. Webb
SGAI
2007
Springer
13 years 11 months ago
Towards a Computationally Efficient Approach to Modular Classification Rule Induction
Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision T...
Frederic T. Stahl, Max Bramer
IFIP12
2008
13 years 6 months ago
Bayesian Networks Optimization Based on Induction Learning Techniques
Obtaining a bayesian network from data is a learning process that is divided in two steps: structural learning and parametric learning. In this paper, we define an automatic learni...
Paola Britos, Pablo Felgaer, Ramón Garc&iac...
AAAI
2006
13 years 6 months ago
When a Decision Tree Learner Has Plenty of Time
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