Universal Approximation of Binary-Tree Hierarchical Fuzzy Systems with Typical FLUs
The universal approximation property of binary-tree hierarchical fuzzy systems (HFS) is examined in this paper. A binary-tree hierarchical fuzzy system with typical FLUs (fuzzy logic units) is defined. The analytical expression of HFS is derived, and the system is shown to preserve universal approximation property. A simple example is also given to show the theory.
Unable to display preview. Download preview PDF.