Computational complexity of hierarchical fuzzy systems

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rattasiri, W., Halgamuge, S.K.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/NAFIPS.2000.877457