Decision tree methods: applications for classification and prediction

By Yanyan Song, Ying Lu. 2015

2,245 citations recorded by the source corpus.

Summary Decision tree methodology is a commonly used data mining method for establishing classification systems based on multiple covariates or for developing prediction algorithms for a target variable. This method classifies a population into branch-like segments that construct an inverted tree with a root node, internal nodes, and leaf nodes. The algorithm is non-parametric and can efficiently deal with large, complicated datasets without imposing a complicated parametric structure. When the sample size is large enough, study data can be divided into training and validation datasets. Using the training dataset to build a decision tree model and a validation dataset to decide on the appropriate tree size needed to achieve the optimal final model. This paper introduces frequently used algorithms used to develop decision trees (including CART, C4.5, CHAID, and QUEST) and describes the SPSS and SAS programs that can be used to visualize tree structure.

Subfields: Computer Networks and Communications, Information Systems, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Hodjat Shirmard
  2. R. Dietmar Müller
  3. Rohitash Chandra
  4. Bahzad Charbuty
  5. Ankit Thakkar
  6. Adnan Mohsin Abdulazeez
  7. Ritika Lohiya
  8. Ehsan Farahbakhsh

In Information Systems

  1. Hodjat Shirmard
  2. R. Dietmar Müller
  3. Rohitash Chandra
  4. Bahzad Charbuty
  5. Ankit Thakkar
  6. Adnan Mohsin Abdulazeez
  7. Ritika Lohiya
  8. Ehsan Farahbakhsh

In Statistics and Probability

  1. Hodjat Shirmard
  2. Jan Adamowski
  3. R. Dietmar Müller
  4. Rohitash Chandra
  5. Bahzad Charbuty
  6. Ankit Thakkar
  7. Adnan Mohsin Abdulazeez
  8. Ritika Lohiya

Citations in the corpus