|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 3 of 11 found articles
| Title: |
Building fast decision trees from large training sets |
| Author: |
Franco-Arcega, A. Carrasco-Ochoa, J.A. Sánchez-Díaz, G. Fco Martínez-Trinidad, J. |
| Appeared in: |
Intelligent data analysis |
| Paging: | Volume 16 (2012) nr. 4 pages 649-664 |
| Year: |
2012-07-19 |
| Contents: |
Decision trees are commonly used in supervised classification. Currently, supervised classification problems with large training sets are very common, however many supervised classifiers cannot handle this amount of data. There are some decision tree induction algorithms that are capable to process large training sets, however almost all of them have memory restrictions because they need to keep in main memory the whole training set, or a big amount of it. Moreover, algorithms that do not have memory restrictions have to choose a subset of the training set, needing extra time for this selection; or they require to specify the values for some parameters that could be very difficult to determine by the user. In this paper, we present a new fast heuristic for building decision trees from large training sets, which overcomes some of the restrictions of the state of the art algorithms, using all the instances of the training set without storing all of them in main memory. Experimental results show that our algorithm is faster than the most recent algorithms for building decision trees from large training sets. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 3 of 11 found articles
| << previous | next >> |