In this paper, we introduce an incremental induction of multivariate decision tree algorithm, called IIMDTS, which allows choosing a different splitting attribute subset in each internal node of the decision tree and it processes large datasets. IIMDTS uses all instances of the training set for building the decision tree without storing the whole training set in memory. Experimental results show that our algorithm is faster than three of the most recent algorithms for building decision trees for large datasets. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Franco-Arcega, A., Carrasco-Ochoa, J. A., Sánchez-Díaz, G., & Martínez-Trinidad, J. F. (2010). Multivariate decision trees using different splitting attribute subsets for large datasets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6085 LNAI, pp. 370–373). https://doi.org/10.1007/978-3-642-13059-5_49
Mendeley helps you to discover research relevant for your work.