Study on centroid type-reduction of general type-2 fuzzy logic systems with sensible beginning weighted enhanced Karnik–Mendel algorithms
General type-2 fuzzy logic systems have received wide concerns in current academic subject. Type-reduction is the kernel module for the systems. This paper shows the interpretations for the beginning of Karnik–Mendel (KM) algorithms. According to the famous numerical integration technique, the weigh...
Uložené v:
| Vydané v: | Soft computing (Berlin, Germany) Ročník 27; číslo 14; s. 9261 - 9279 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.07.2023
|
| Predmet: | |
| ISSN: | 1432-7643, 1433-7479 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | General type-2 fuzzy logic systems have received wide concerns in current academic subject. Type-reduction is the kernel module for the systems. This paper shows the interpretations for the beginning of Karnik–Mendel (KM) algorithms. According to the famous numerical integration technique, the weighting approaches of enhanced Karnik–Mendel (EKM) algorithms are put forward. Then, the sensible beginning weighted enhanced Karnik–Mendel (SBWEKM) algorithms are put forward to perform the centroid type-reduction. Compared with the EKM algorithms, WEKM algorithms and SBEKM algorithms, this approach helps to improve both the absolute errors and convergence speeds as shown in four computer simulation experiments. |
|---|---|
| ISSN: | 1432-7643 1433-7479 |
| DOI: | 10.1007/s00500-023-08269-8 |