A new incremental algorithm for induction of multivariate decision trees for large datasets

Several algorithms for induction of decision trees have been developed to solve problems with large datasets, however some of them have spatial and/or runtime problems using the whole training sample for building the tree and others do not take into account the whole training set. In this paper, we introduce a new algorithm for inducing decision trees for large numerical datasets, called IIMDT, which builds the tree in an incremental way and therefore it is not necesary to keep in main memory the whole training set. A comparison between IIMDT and ICE, an algorithm for inducing decision trees for large datasets, is shown. © 2008 Springer Berlin Heidelberg.

Decision trees; Large datasets; Supervised classification Classification (of information); Decision trees; Forestry; Trees (mathematics); Incremental algorithm; Large datasets; Main memory; Multivariate decision tree; Numerical datasets; Supervised classification; Training sample; Training sets; Large dataset

VIVO