Radial Basis Function Networks and Decision Trees in the Determination of a Classifier
In this paper a nonparametric classifier which combines radial basis function networks and binary classification trees is proposed. The joint use of the two methods may be preferable not only with respect to radial basis function networks, but also to recursive partitioning techniques, as it may help to integrate the knowledge acquired by the single classifiers. A simulation study, based on a two-class problem, shows that this method represents a valid solution, particularly in the presence of noise variables.
Unable to display preview. Download preview PDF.
- BISHOP, C.M. (1995): Neural Networks for Pattern Recognition. Clarendon Press, OxfordGoogle Scholar
- BREIMAN, L., FRIEDMAN, J.H., OLSHEN, R.A. and STONE C.J. (1984): Classification and Regression Trees, Wadsworth and Brooks/Cole, Monterey.Google Scholar
- MOODY, J. and DARKEN, C.J. (1989): Fast Learning in Networks of Locally- Tuned Processing units. Neural Computation 1 (2), 281–294.Google Scholar
- RIPLEY, B.D. (1996): Pattern Recognition and Neural Networks, Cambridge University Press, Cambridge.Google Scholar
- TARASSENKO, L. (1994): discussion of Ripley B. D. Neural networks and related methods for classification, Journal of the Royal statistical Society, B 56(3), 409–456Google Scholar