Forests of Decision Trees
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. Methods for creating forests of decision trees based on Separability of Split Value (SSV) criterion are presented. Preliminary results confirm their usefulness in understanding data structures.
KeywordsDecision Tree Cross Validation Thyroid Surgery Beam Search Search Stage
Unable to display preview. Download preview PDF.
- 2.Grąbczewski K, Duch W. (1999) A general purpose separability criterion for classification systems, 4th Conference on Neural Networks and Their Applications, Zakopane, Poland, pp. 203–208Google Scholar
- 3.Grąbczewski K. Duch W. (2000) The Separability of Split Value Criterion, 5th Conference on Neural Networks and Soft Computing, Zakopane, Poland.Google Scholar
- 4.Blake, C.L, Merz, C.J. (1998). UCI Repository of machine learning databases http://www.ics.uci.edu/mlearn/MLRepository.html. Irvine, CA: University of California, Department of Information and Computer Science.
- 5.Bobrowski L, Kr@towska M, Kr@towski M. (1997) Design of neural classifying networks by using dipolar criterions. 3rd Conf on Neural Networks and Their Applications, Kule, PolandGoogle Scholar
- 6.Breiman, L. (1998): Bias-Variance, regularization, instability and stabilization. In: Bishop, C. (Ed.) Neural Networks and Machine Learning. Springer, Berlin, Heidelberg, New YorkGoogle Scholar