New Methodology to Approximate Type-Reduction Based on a Continuous Root-Finding Karnik Mendel Algorithm
AbstractInterval Type-2 fuzzy systems allow the possibility of considering uncertainty in models based on fuzzy systems, and enable an increase of robustness in solutions to applications, but also increase the complexity of the fuzzy system design. Several attempts have been previously proposed to reduce the computational cost of the type-reduction stage, as this process requires a lot of computing time because it is basically a numerical approximation based on sampling, and the computational cost is proportional to the number of samples, but also the error is inversely proportional to the number of samples. Several works have focused on reducing the computational cost of type-reduction by developing strategies to reduce the number of operations. The first type-reduction method was proposed by Karnik and Mendel (KM), and then was followed by its enhanced version called EKM. Then continuous versions were called CKM and CEKM, and there were variations of this and also other types of variations that eliminate the type-reduction process reducing the computational cost to a Type-1 defuzzification, such as the Nie-Tan versions and similar enhancements. In this work we analyzed and proposed a variant of CEKM by viewing this process as solving a root-finding problem, in this way taking advantage of existing numerical methods to solve the type-reduction problem, the main objective being eliminating the type-reduction process and also providing a continuous solution of the defuzzification. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Ontiveros-Robles, E.; Melin, P.; Castillo, O. New Methodology to Approximate Type-Reduction Based on a Continuous Root-Finding Karnik Mendel Algorithm. Algorithms 2017, 10, 77.
Ontiveros-Robles E, Melin P, Castillo O. New Methodology to Approximate Type-Reduction Based on a Continuous Root-Finding Karnik Mendel Algorithm. Algorithms. 2017; 10(3):77.Chicago/Turabian Style
Ontiveros-Robles, Emanuel; Melin, Patricia; Castillo, Oscar. 2017. "New Methodology to Approximate Type-Reduction Based on a Continuous Root-Finding Karnik Mendel Algorithm." Algorithms 10, no. 3: 77.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.