A proposal to speed up the computation of the centroid of an interval type-2 fuzzy set (Q360592): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Summary: This paper presents two new algorithms that speed up the centroid computation of an interval type-2 fuzzy set. The algorithms include precomputation of the main operations and initialization based on the concept of uncertainty bounds. Simulations over different kinds of footprints of uncertainty reveal that the new algorithms achieve computation time reductions with respect to the Enhanced-Karnik algorithm, ranging from 40 to 70\%. The results suggest that the initialization used in the new algorithms effectively reduces the number of iterations to compute the extreme points of the interval centroid while precomputation reduces the computational cost of each iteration. | |||
Property / review text: Summary: This paper presents two new algorithms that speed up the centroid computation of an interval type-2 fuzzy set. The algorithms include precomputation of the main operations and initialization based on the concept of uncertainty bounds. Simulations over different kinds of footprints of uncertainty reveal that the new algorithms achieve computation time reductions with respect to the Enhanced-Karnik algorithm, ranging from 40 to 70\%. The results suggest that the initialization used in the new algorithms effectively reduces the number of iterations to compute the extreme points of the interval centroid while precomputation reduces the computational cost of each iteration. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68T37 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6202105 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58918387 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/158969 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1994109768 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Advances in type-2 fuzzy sets and systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3500116 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2715695 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Study on enhanced Karnik-Mendel algorithms: initialization explanations and computation improvements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: MODELLING AND SIMULATION OF THE DEFUZZIFICATION STAGE OF A TYPE-2 FUZZY CONTROLLER USING VHDL CODE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Advantages of the Enhanced Opposite Direction Searching Algorithm for Computing the Centroid of An Interval Type-2 Fuzzy Set / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:50, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A proposal to speed up the computation of the centroid of an interval type-2 fuzzy set |
scientific article |
Statements
A proposal to speed up the computation of the centroid of an interval type-2 fuzzy set (English)
0 references
27 August 2013
0 references
Summary: This paper presents two new algorithms that speed up the centroid computation of an interval type-2 fuzzy set. The algorithms include precomputation of the main operations and initialization based on the concept of uncertainty bounds. Simulations over different kinds of footprints of uncertainty reveal that the new algorithms achieve computation time reductions with respect to the Enhanced-Karnik algorithm, ranging from 40 to 70\%. The results suggest that the initialization used in the new algorithms effectively reduces the number of iterations to compute the extreme points of the interval centroid while precomputation reduces the computational cost of each iteration.
0 references
0 references
0 references