Aggregation Using the Fuzzy Weighted Average as Computed by the Karnik–Mendel Algorithms
Authors:
- 7 February 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 16 (1) , 1-12
Abstract
By connecting work from two different problems-the fuzzy weighted average (FWA) and the generalized centroid of an interval type-2 fuzzy set-a new alpha-cut algorithm for solving the FWA problem has been obtained, one that is monotonically and superexponentially convergent. This new algorithm uses the Karnik-Mendel (KM) algorithms to compute the FWA -cut end-points. It appears that the KM -cut algorithms approach for computing the FWA requires the fewest iterations to date, and may therefore be the fastest available FWA algorithm to date.Keywords
This publication has 10 references indexed in Scilit:
- Super-Exponential Convergence of the Karnik–Mendel Algorithms for Computing the Centroid of an Interval Type-2 Fuzzy SetIEEE Transactions on Fuzzy Systems, 2007
- A generalized vertex method for computing with fuzzy intervals2005
- Fuzzy sets for words: a new beginning2004
- Analysis and efficient implementation of a linguistic fuzzy c-meansIEEE Transactions on Fuzzy Systems, 2002
- Centroid of a type-2 fuzzy setInformation Sciences, 2001
- Fuzzy weighted average: The linear programming approach via Charnes and Cooper's ruleFuzzy Sets and Systems, 2001
- An efficient algorithm for fuzzy weighted averageFuzzy Sets and Systems, 1997
- Fuzzy weighted average: A max-min paired elimination methodComputers & Mathematics with Applications, 1996
- Fuzzy weighted average: An improved algorithmFuzzy Sets and Systems, 1992
- Fuzzy weighted averages and implementation of the extension principleFuzzy Sets and Systems, 1987