Sciweavers

507 search results - page 7 / 102
» Generating Better Decision Trees
Sort
View
AAAI
2006
13 years 9 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
1999
IEEE
14 years 8 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
AUSAI
2004
Springer
14 years 1 months ago
MML Inference of Oblique Decision Trees
We propose a multivariate decision tree inference scheme by using the minimum message length (MML) principle (Wallace and Boulton, 1968; Wallace and Dowe, 1999). The scheme uses MM...
Peter J. Tan, David L. Dowe
ICPR
2002
IEEE
14 years 19 days ago
Tree Pruning for Output Coded Ensembles
Output Coding is a method of converting a multiclass problem into several binary subproblems and gives an ensemble of binary classifiers. Like other ensemble methods, its perform...
Terry Windeatt, Gholamreza Ardeshir
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický