Generalized neurofuzzy network modeling algorithms using Bezier-Bernstein polynomial functions and additive decomposition
Hong, X. and Harris, C.J. (2000) Generalized neurofuzzy network modeling algorithms using Bezier-Bernstein polynomial functions and additive decomposition. IEEE Transactions on Neural Networks, 11 (4). pp. 889-902. ISSN 1045-9227
Full text not archived in this repository.
To link to this article DOI: 10.1109/72.857770
This paper introduces a new neurofuzzy model construction algorithm for nonlinear dynamic systems based upon basis functions that are Bezier-Bernstein polynomial functions. This paper is generalized in that it copes with n-dimensional inputs by utilising an additive decomposition construction to overcome the curse of dimensionality associated with high n. This new construction algorithm also introduces univariate Bezier-Bernstein polynomial functions for the completeness of the generalized procedure. Like the B-spline expansion based neurofuzzy systems, Bezier-Bernstein polynomial function based neurofuzzy networks hold desirable properties such as nonnegativity of the basis functions, unity of support, and interpretability of basis function as fuzzy membership functions, moreover with the additional advantages of structural parsimony and Delaunay input space partition, essentially overcoming the curse of dimensionality associated with conventional fuzzy and RBF networks. This new modeling network is based on additive decomposition approach together with two separate basis function formation approaches for both univariate and bivariate Bezier-Bernstein polynomial functions used in model construction. The overall network weights are then learnt using conventional least squares methods. Numerical examples are included to demonstrate the effectiveness of this new data based modeling approach.
Centaur Editors: Update this record