Decision trees can initialize radial-basis function networks
Author:
- 1 January 1998
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 9 (5) , 813-821
Abstract
Successful implementations of radial-basis function (RBF) networks for classification tasks must deal with architectural issues, the burden of irrelevant attributes, scaling, and some other problems. This paper addresses these issues by initializing RBF networks with decision trees that define relatively pure regions in the instance space; each of these regions then determines one basis function. The resulting network is compact, easy to induce, and has favorable classification accuracy.Keywords
This publication has 18 references indexed in Scilit:
- Initialization of neural networks by means of decision treesKnowledge-Based Systems, 1995
- Rule-Based Neural Networks for Classification and Probability EstimationNeural Computation, 1992
- On the training of radial basis function classifiersNeural Networks, 1992
- Handwritten Digit Recognition Using K Nearest-Neighbor, Radial-Basis Function, and Backpropagation Neural NetworksNeural Computation, 1991
- Fast training algorithms for multilayer neural netsIEEE Transactions on Neural Networks, 1991
- A tree-structured adaptive network for function approximation in high-dimensional spacesIEEE Transactions on Neural Networks, 1991
- Orthogonal least squares learning algorithm for radial basis function networksIEEE Transactions on Neural Networks, 1991
- Regularization Algorithms for Learning That Are Equivalent to Multilayer NetworksScience, 1990
- Entropy nets: from decision trees to neural networksProceedings of the IEEE, 1990
- Fast Learning in Networks of Locally-Tuned Processing UnitsNeural Computation, 1989