ADAPTIVE TREE-STRUCTURED SELF-GENERATING RADIAL BASIS FUNCTION NETWORK AND ITS PERFORMANCE EVALUATION

Citation
M. Watanabe et al., ADAPTIVE TREE-STRUCTURED SELF-GENERATING RADIAL BASIS FUNCTION NETWORK AND ITS PERFORMANCE EVALUATION, International journal of approximate reasoning, 13(4), 1995, pp. 303-326
Citations number
15
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence
ISSN journal
0888613X
Volume
13
Issue
4
Year of publication
1995
Pages
303 - 326
Database
ISI
SICI code
0888-613X(1995)13:4<303:ATSRBF>2.0.ZU;2-P
Abstract
Several algorithms have been proposed to identify a large scale system , such as the neuro-fuzzy GMDH, and the fuzzy modeling using a fuzzy n eural network. As another approach, Sanger proposed a tree-structured adaptive network But in Sanger's network, it is not clear how to deter mine the initial disposition of bases and the number of bases in each subtree. We propose a nonlinear modeling method called the adaptive tr ee-structured self-generating radial basis function network (A Tree-RB FN). In A Tree-RBFN, we take the maximum absolute error (MAE) selectio n method in order to improve Sanger's model. We combine Sanger's tree- structured adaptive network for an overall model structure with the MA E selection method for a subtree identification problem. In ATree-RBFN , the tuning parameters are not only the coefficients but also the cen ters and widths of bases, and a subtree can be generated under all lea f nodes. Then, the input-output data can be divided into the training data set and the checking data set, and an element of inputs in each s ubtree is selected according to the corresponding aror value from the checking data set. We also demonstrate the effectiveness of the propos ed method by solving several numerical examples.