Top-down induction of decision trees classifiers - a survey

@article{Rokach2005TopdownIO,
  title={Top-down induction of decision trees classifiers - a survey},
  author={Lior Rokach and Oded Maimon},
  journal={IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)},
  year={2005},
  volume={35},
  pages={476-487}
}
  • L. Rokach, O. Maimon
  • Published 1 November 2005
  • Computer Science
  • IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
Decision trees are considered to be one of the most popular approaches for representing classifiers. Researchers from various disciplines such as statistics, machine learning, pattern recognition, and data mining considered the issue of growing a decision tree from available data. This paper presents an updated survey of current methods for constructing decision tree classifiers in a top-down manner. The paper suggests a unified algorithmic framework for presenting these algorithms and… 
View on IEEE
ece.unm.edu
708 Citations
Highly Influential Citations
30
Background Citations
221
Methods Citations
182
Results Citations
4

Figures and Tables from this paper

708 Citations

Issues in Optimization of Decision Tree Learning : A Survey
TLDR
This paper is an attempt to summarize the proposed approaches, tools etc. for decision tree learning with emphasis on optimization of constructed trees and handling large datasets.
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.
Analysis of Decision Tree-A Survey
Decision tree is a fast and efficient classification prediction algorithm in data mining which is most widely used for decision making. It is one of the most popular data-mining techniques for…
Inducing Decision Trees based on a Cluster Quality Index
TLDR
This paper introduces a new procedure for inducing decision trees, to obtain trees that are more accurate, more compact, and more balanced.
Inducing Decision Trees based on a Cluster Quality Index
TLDR
This paper introduces a new procedure for inducing decision trees, to obtain trees that are more accurate, more compact, and more balanced.
A framework for bottom-up induction of oblique decision trees
Classification Based on Decision Tree Algorithm for Machine Learning
TLDR
This paper provides a detailed approach to the decision trees, and all of the approaches analyzed were discussed to illustrate the themes of the authors and identify the most accurate classifiers.
Global Induction of Decision Trees
  • M. Kretowski
  • Computer Science
    Encyclopedia of Data Warehousing and Mining
  • 2009
TLDR
Decision trees are, besides decision rules, one of the most popular forms of knowledge representation in Knowledge Discovery in Databases process and implementations of the classical decision tree induction algorithms are included in the majority of data mining systems.
Comparison of Naive Bayes, Random Forest, Decision Tree, Support Vector Machines, and Logistic Regression Classifiers for Text Reviews Classification
TLDR
Naïve Bayes, Random Forest, Decision Tree, Support Vector Machines, and Logistic Regression classifiers implemented in Apache Spark, i.e. the in-memory intensive computing platform, are investigated by evaluating the classification accuracy, based on the size of training data sets, and the number of n-grams.
Clus-DTI: improving decision-tree classification with a clustering-based decision-tree induction algorithm
TLDR
This paper proposes a new decision-tree induction algorithm based on clustering named Clus-DTI and investigates how clustering data as a part of the induction process affects the accuracy and complexity of the generated models.
...
...

References

SHOWING 1-10 OF 105 REFERENCES
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
TLDR
This paper surveys existing work on decision tree construction, attempting to identify the important issues involved, directions the work has taken and the current state of the art.
A survey of decision tree classifier methodology
TLDR
The subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed, and the relation between decision trees and neutral networks (NN) is also discussed.
Automatic construction of decision trees for classification
TLDR
An algorithm for learning decision trees for classification and prediction is described which converts real-valued attributes into intervals using statistical considerations, and some applications are described, especially the task of predicting the high water level in a mountain river.
Decision tree discovery
TLDR
The two most commonly used systems for induction of decision trees for classi cation: C4.5 and CART are described and rules can be derived from decision trees and point to some di erence in the induction of regression trees.
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
TLDR
Experimental results with real-life as well as synthetic data sets demonstrate the effectiveness of PUBLIC, an improved decision tree classifier that integrates the second “pruning’ phase with the initial “building” phase.
Decision Tree Induction Based on Efficient Tree Restructuring
TLDR
Two approaches to decision tree induction are described, one being incremental tree induction (ITI) and the other being non-incremental tree induction using a measure of tree quality instead of test quality (DMTI), which offer new computational and classifier characteristics that lend themselves to particular applications.
BOAT—optimistic decision tree construction
TLDR
A new algorithm (BOAT) for decision tree construction is introduced that improves upon earlier algorithms in both performance and functionality and is the first scalable algorithm with the ability to incrementally update the tree with respect to both insertions and deletions over the dataset.
An Empirical Comparison of Pruning Methods for Decision Tree Induction
TLDR
This paper compares five methods for pruning decision trees, developed from sets of examples, and shows that three methods—critical value, error complexity and reduced error—perform well, while the other two may cause problems.
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.
Unknown Attribute Values in Induction
...
...