Title
A New Incremental Algorithm for Induction of Multivariate Decision Trees for Large Datasets
Abstract
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.
Year
DOI
Venue
2008
10.1007/978-3-540-88906-9_36
IDEAL
Keywords
Field
DocType
large numerical datasets,large datasets,decision tree,multivariate decision trees,new algorithm,runtime problem,whole training set,new incremental algorithm,main memory,whole training sample,decision trees
Decision tree,Data mining,Computer science,Artificial intelligence,ID3 algorithm,Alternating decision tree,Training set,Pattern recognition,Multivariate statistics,Algorithm,Decision tree learning,Machine learning,Incremental decision tree
Conference
Volume
ISSN
Citations 
5326
0302-9743
2
PageRank 
References 
Authors
0.38
11
4