A bottom-up oblique decision tree induction algorithm

@article{Barros2011ABO,
  title={A bottom-up oblique decision tree induction algorithm},
  author={Rodrigo C. Barros and Ricardo Cerri and Pablo A. Jaskowiak and Andr{\'e} Carlos Ponce de Leon Ferreira de Carvalho},
  journal={2011 11th International Conference on Intelligent Systems Design and Applications},
  year={2011},
  pages={450-456}
}
Decision tree induction algorithms are widely used in knowledge discovery and data mining, specially in scenarios where model comprehensibility is desired. A variation of the traditional univariate approach is the so-called oblique decision tree, which allows multivariate tests in its non-terminal nodes. Oblique decision trees can model decision boundaries that are oblique to the attribute axes, whereas univariate trees can only perform axis-parallel splits. The majority of the oblique and… 

Figures and Tables from this paper

Decision-Tree Induction
TLDR
This chapter presents in detail the most common approach for decision-tree induction: top-down induction and briefly comment on some alternative strategies for induction of decision trees.
Automatic Design of Decision-Tree Induction Algorithms
TLDR
This thesis proposes to automatically generate decision-tree induction algorithms based on the evolutionary algorithms paradigm, which improves solutions based on metaphors of biological processes and shows that HEAD-DT is prone to a special case of overfitting when it is executed under the second scenario of the general framework.
On the automatic design of decision-tree induction algorithms
TLDR
This thesis proposes to automatically generate decision-tree induction algorithms based on the evolutionary algorithms paradigm, which improves solutions based on metaphors of biological processes and shows that HEAD-DT is prone to a special case of overfitting when it is executed under the second scenario of the general framework.
Iterative Dichotomizer 3 (ID3) Decision Tree: A Machine Learning Algorithm for Data Classification and Predictive Analysis
TLDR
The use of ID3 decision tree, a machine learning algorithm, is used to predict weather condition for an out tennis match to provide information for tennis and other sports athletes who wish to play out-door games.
Evolutionary Design of Decision-Tree Algorithms Tailored to Microarray Gene Expression Data Sets
TLDR
A hyper-heuristic evolutionary algorithm called HEAD-DT is proposed that evolves design components of top-down decision-tree induction algorithms and is capable of generating algorithms that significantly outperform the baseline manually designed decision-Tree algorithms regarding predictive accuracy and F-measure.
A hyper-heuristic evolutionary algorithm for automatically designing decision-tree algorithms
TLDR
This work proposes a hyper-heuristic evolutionary algorithm for automatically generating decision-tree induction algorithms, named HEAD-DT, and shows that it can generate algorithms that significantly outperform C4.5 and CART regarding predictive accuracy and F-Measure.
A Survey on: Stratified mapping of Microarray Gene Expression datasets to decision tree algorithm aided through Evolutionary Design
TLDR
A novel approach of hyper-heuristic evolutionary algorithm called HEAD-DT that evolves design components of top-down decision tree induction algorithms can be used to improve the classification accuracy.
A classification scheme for plotting Microarray Gene Expression Datasets to Decision Tree Algorithm using Distributed Systems
TLDR
A novel approach of a hyperheuristic evolutionary algorithm using distributed systems for optimally combining design components from decision-tree algorithms called HEAD-DT is proposed, which automatically designs novel decision-Tree algorithms, tailored to a particular type of data sets, associated with a given application domain.
An Outlook in Some Aspects of Hybrid Decision Tree Classification Approach: A Survey
TLDR
This survey has been elaborating the various approaches of converting decision tree to hybridized decision tree, using use of clustering, naive Bayes, and AVL tree, fuzzy and genetic algorithm to improve accuracy of decision tree classifier.
...
...

References

SHOWING 1-10 OF 52 REFERENCES
BOAI: Fast Alternating Decision Tree Induction Based on Bottom-Up Evaluation
TLDR
A fast ADTree induction algorithm (BOAI) based on "bottom-up" evaluation, which offers high performance on massive data without sacrificing classification accuracy and provides better performance than TreeNet and Random Forests, which are considered as efficient classification models.
OC1: A Randomized Induction of Oblique Decision Trees
TLDR
A new method that combines deterministic and randomized procedures to search for a good tree is explored, and the accuracy of the trees found with the method matches or exceeds the best results of other machine learning methods.
Oblique Decision Trees using embedded Support Vector Machines in classifier ensembles
TLDR
A new base classifier is presented that utilizes oblique decision tree technology based on support vector machines for the construction of oblique (non-axis parallel) tests on the nodes of the decision tree inducted by a number of heuristic techniques for enhancing the tree construction process by better estimation of the gain obtained by an oblique split at any tree node.
A System for Induction of Oblique Decision Trees
TLDR
This system, OC1, combines deterministic hill-climbing with two forms of randomization to find a good oblique split (in the form of a hyperplane) at each node of a decision tree.
Functional Trees
TLDR
This work introduces a simple unifying framework for multivariate tree learning that combines a univariate decision tree with a linear function by means of constructive induction and uses the bias-variance decomposition of the error, cluster analysis, and learning curves as tools for analysis.
Induction of Oblique Decision Trees
TLDR
A randomized technique for partitioning examples using oblique hyperplanes to create smaller but equally accurate decision trees than those created by other methods, and is found to produce surprisingly small trees without losing predic-tive accuracy.
A Survey of Evolutionary Algorithms for Decision-Tree Induction
TLDR
This paper presents a survey of evolutionary algorithms that are designed for decision-tree induction, which provides an up-to-date overview that is fully focused on evolutionary algorithms and decision trees and does not concentrate on any specific evolutionary approach.
Non-Linear Decision Trees - NDT
TLDR
The crux of this method consists of the creation of new features and the augmenta tion of the primitive features with these new ones and the resulted non linear decision trees are more accurate than their axis parallel or oblique counterparts.
Top-down induction of decision trees classifiers - a survey
  • L. Rokach, O. Maimon
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
  • 2005
TLDR
An updated survey of current methods for constructing decision tree classifiers in a top-down manner is presented and a unified algorithmic framework for presenting these algorithms is suggested.
A Comparative Analysis of Methods for Pruning Decision Trees
TLDR
A comparative study of six well-known pruning methods with the aim of understanding their theoretical foundations, their computational complexity, and the strengths and weaknesses of their formulation, and an objective evaluation of the tendency to overprune/underprune observed in each method is made.
...
...