Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Zhang, N. (2006). Universal Approximation of Binary-Tree Hierarchical Fuzzy Systems with Typical FLUs. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)