C4.5: programs for machine learning
C4.5: programs for machine learning
BOAT—optimistic decision tree construction
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data Mining: Introductory and Advanced Topics
Data Mining: Introductory and Advanced Topics
Database Mining: A Performance Perspective
IEEE Transactions on Knowledge and Data Engineering
SLIQ: A Fast Scalable Classifier for Data Mining
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
RainForest - A Framework for Fast Decision Tree Construction of Large Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
SPRINT: A Scalable Parallel Classifier for Data Mining
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
Combining multiple class distribution modified subsamples in a single tree
Pattern Recognition Letters
Model trees for classification of hybrid data types
IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Multivariate decision trees using different splitting attribute subsets for large datasets
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Building fast decision trees from large training sets
Intelligent Data Analysis
Hi-index | 0.02 |
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.