Abstract
In many cases it is better to extract a set of decision trees and a set of possible logical data descriptions instead of a single model. The trees that include premises with constraints on the distances from some reference points are more flexible because they provide nonlinear decision borders. Methods for creating heterogeneous forests of decision trees based on Separability of Split Value (SSV) criterion are presented. The results confirm their usefulness in understanding data structures. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Gra̧bczewski, K., & Duch, W. (2002). Heterogeneous forests of decision trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2415 LNCS, pp. 504–509). Springer Verlag. https://doi.org/10.1007/3-540-46084-5_82
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
