Sciweavers

70 search results - page 2 / 14
» The Problem of Missing Values in Decision Tree Grafting
Sort
View
ICML
1990
IEEE
13 years 11 months ago
An Incremental Method for Finding Multivariate Splits for Decision Trees
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
Paul E. Utgoff, Carla E. Brodley
ILP
2003
Springer
14 years 23 days ago
A Multi-relational Decision Tree Learning Algorithm - Implementation and Experiments
We describe an efficient implementation (MRDTL-2) of the Multi-relational decision tree learning (MRDTL) algorithm [23] which in turn was based on a proposal by Knobbe et al. [19] ...
Anna Atramentov, Hector Leiva, Vasant Honavar
ICML
2004
IEEE
14 years 8 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...
ECML
1997
Springer
13 years 11 months ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
JMLR
2010
108views more  JMLR 2010»
13 years 2 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...