Sciweavers

132 search results - page 11 / 27
» Induction of Oblique Decision Trees
Sort
View
EVOW
2010
Springer
15 years 6 months 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
ICML
2003
IEEE
16 years 18 days ago
Decision-tree Induction from Time-series Data Based on a Standard-example Split Test
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
Yuu Yamada, Einoshin Suzuki, Hideto Yokoi, Katsuhi...
AAAI
2006
15 years 1 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
FLAIRS
2004
15 years 1 months ago
Decision Tree Extraction from Trained Neural Networks
Artificial Neural Networks (ANNs) have proved both a popular and powerful technique for pattern recognition tasks in a number of problem domains. However, the adoption of ANNs in ...
Darren Dancey, David McLean, Zuhair Bandar
SSPR
1998
Springer
15 years 4 months ago
Multi-interval Discretization Methods for Decision Tree Learning
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
Petra Perner, Sascha Trautzsch