Next Article in Journal
An Efficient Algorithm for the Separable Nonlinear Least Squares Problem
Next Article in Special Issue
Design of an Optimized Fuzzy Classifier for the Diagnosis of Blood Pressure with a New Computational Method for Expert Rule Optimization
Previous Article in Journal
A Genetic Algorithm Using Triplet Nucleotide Encoding and DNA Reproduction Operations for Unconstrained Optimization Problems
Previous Article in Special Issue
An Easily Understandable Grey Wolf Optimizer and Its Application to Fuzzy Controller Tuning
Article Menu

Export Article

Open AccessArticle
Algorithms 2017, 10(3), 77; doi:10.3390/a10030077

New Methodology to Approximate Type-Reduction Based on a Continuous Root-Finding Karnik Mendel Algorithm

Tijuana Institute of Technology, 22414 Tijuana, Mexico
*
Author to whom correspondence should be addressed.
Received: 30 May 2017 / Revised: 29 June 2017 / Accepted: 1 July 2017 / Published: 5 July 2017
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
View Full-Text   |   Download PDF [3785 KB, uploaded 13 July 2017]   |  

Abstract

Interval 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
Keywords: interval type-2 fuzzy logic; type-reduction; type-2 fuzzy control; type-2 fuzzy edge detection interval type-2 fuzzy logic; type-reduction; type-2 fuzzy control; type-2 fuzzy edge detection
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

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.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top