Sciweavers

55 search results - page 2 / 11
» A new metric splitting criterion for decision trees
Sort
View
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
13 years 9 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
ICML
2000
IEEE
14 years 6 months ago
Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
Chris Drummond, Robert C. Holte
ICML
2004
IEEE
14 years 6 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
EVOW
2010
Springer
14 years 18 days ago
Top-Down Induction of Phylogenetic Trees
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...
Celine Vens, Eduardo Costa, Hendrik Blockeel
EGC
2009
Springer
13 years 3 months ago
A Bayes Evaluation Criterion for Decision Trees
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
Nicolas Voisine, Marc Boullé, Carine Hue