Computational complexity of hierarchical fuzzy systems
Waratt Rattasiri, Saman Kumara Halgamuge · 2002
The computational complexity of a conventional fuzzy system (CFS) and hierarchical fuzzy systems without defuzzification (HFSs w/o DF) are analysed in terms of the electronic components needed to construct a computational circuit to calculate the intermediate outputs between layers and to carry out crisp output from the last layer in the hierarchy. Furthermore, two different types of HFS w/o DF are discussed, providing more options to which they are optimally suited with the characteristics of the original CFS.