Show simple item record

dc.contributor.authorMendel, Jerry M., 1938-en
dc.contributor.authorLiu, F.en
dc.date.accessioned2008-11-24T13:24:16Z
dc.date.available2008-11-24T13:24:16Z
dc.date.issued2007-04-01en
dc.identifier.citationMendel, J. M. and Liu, F. (2007) Super-exponential convergence of the Karnik-Mendel algorithms for computing the centroid of an interval type-2 fuzzy set. IEEE Transactions on Fuzzy Systems, 15 (2), pp. 309-320.
dc.identifier.issn1063-6706en
dc.identifier.urihttp://hdl.handle.net/2086/192
dc.descriptionKM algorithms are widely used to perform type-reduction and to compute the centroid of type-2 fuzzy sets. Because KM algorithms are iterative, there has been some concern about their convergance time. Many people have observed, from simulations, that convergence occurs rapidly, i.e. under 10 iterations; but, it is one thing to observe this in simulations and another thing to mathematically prove super-exponential convergence, as is done in this paper. So, by mathematically proving superexponential convergence, Mendel and Liu have provided the type- 2 fuzzy set community with concrete evidence of the speed of the KM Algorithms.en
dc.language.isoenen
dc.publisherIEEEen
dc.subjectRAE 2008
dc.subjectUoA 23 Computer Science and Informatics
dc.subjectcentroid
dc.subjectinterval type-2 fuzzy sets
dc.subjectKarnik-Mendel algorithms
dc.titleSuper-exponential convergence of the Karnik-Mendel algorithms for computing the centroid of an interval type-2 fuzzy seten
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1109/TFUZZ.2006.882463en
dc.researchgroupCentre for Computational Intelligence


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record