Three new uncertainty bound methods of Karnik-Mendel algorithms

Xinwang Liu; Qian Zhu; Song Guo

doi:10.1109/FUZZ-IEEE.2013.6622366

Three new uncertainty bound methods of Karnik-Mendel algorithms

Xinwang Liu, Qian Zhu, Song Guo

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

1 Citation (Scopus)

Abstract

Karnik-Mendel (KM) algorithms are important tools for the centroid computation or type reduction in the type-2 fuzzy logic. To release the possible computational bottleneck of the iteration of KM algorithms, some uncertainty bound methods are proposed. In the present paper, the current uncertainty bounds are extended and improved with three new uncertainty bound methods for the centroid computation of interval type-2 fuzzy sets. The New uncertainty bound methods can be further improved if some prior information is available or be be improved from the current bound values. Theoretical analysis proves the validity of our new approaches.

Original language	English
Title of host publication	FUZZ-IEEE 2013 - 2013 IEEE International Conference on Fuzzy Systems
DOIs	https://doi.org/10.1109/FUZZ-IEEE.2013.6622366
Publication status	Published - 22 Nov 2013
Externally published	Yes
Event	2013 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2013 - Hyderabad, India Duration: 7 Jul 2013 → 10 Jul 2013

Conference

Conference	2013 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2013
Country/Territory	India
City	Hyderabad
Period	7/07/13 → 10/07/13

Keywords

Karnik-Mendel (KM) algorithms
Type-2 fuzzy set and system
Uncertainty bound method

ASJC Scopus subject areas

Software
Artificial Intelligence
Applied Mathematics
Theoretical Computer Science

More information

10.1109/FUZZ-IEEE.2013.6622366

Cite this

@inproceedings{b0db771619a3412bb509166775d7bdab,

title = "Three new uncertainty bound methods of Karnik-Mendel algorithms",

abstract = "Karnik-Mendel (KM) algorithms are important tools for the centroid computation or type reduction in the type-2 fuzzy logic. To release the possible computational bottleneck of the iteration of KM algorithms, some uncertainty bound methods are proposed. In the present paper, the current uncertainty bounds are extended and improved with three new uncertainty bound methods for the centroid computation of interval type-2 fuzzy sets. The New uncertainty bound methods can be further improved if some prior information is available or be be improved from the current bound values. Theoretical analysis proves the validity of our new approaches.",

keywords = "Karnik-Mendel (KM) algorithms, Type-2 fuzzy set and system, Uncertainty bound method",

author = "Xinwang Liu and Qian Zhu and Song Guo",

year = "2013",

month = nov,

day = "22",

doi = "10.1109/FUZZ-IEEE.2013.6622366",

language = "English",

isbn = "9781479900220",

booktitle = "FUZZ-IEEE 2013 - 2013 IEEE International Conference on Fuzzy Systems",

note = "2013 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2013 ; Conference date: 07-07-2013 Through 10-07-2013",

}

TY - GEN

T1 - Three new uncertainty bound methods of Karnik-Mendel algorithms

AU - Liu, Xinwang

AU - Zhu, Qian

AU - Guo, Song

PY - 2013/11/22

Y1 - 2013/11/22

N2 - Karnik-Mendel (KM) algorithms are important tools for the centroid computation or type reduction in the type-2 fuzzy logic. To release the possible computational bottleneck of the iteration of KM algorithms, some uncertainty bound methods are proposed. In the present paper, the current uncertainty bounds are extended and improved with three new uncertainty bound methods for the centroid computation of interval type-2 fuzzy sets. The New uncertainty bound methods can be further improved if some prior information is available or be be improved from the current bound values. Theoretical analysis proves the validity of our new approaches.

AB - Karnik-Mendel (KM) algorithms are important tools for the centroid computation or type reduction in the type-2 fuzzy logic. To release the possible computational bottleneck of the iteration of KM algorithms, some uncertainty bound methods are proposed. In the present paper, the current uncertainty bounds are extended and improved with three new uncertainty bound methods for the centroid computation of interval type-2 fuzzy sets. The New uncertainty bound methods can be further improved if some prior information is available or be be improved from the current bound values. Theoretical analysis proves the validity of our new approaches.

KW - Karnik-Mendel (KM) algorithms

KW - Type-2 fuzzy set and system

KW - Uncertainty bound method

UR - http://www.scopus.com/inward/record.url?scp=84887838802&partnerID=8YFLogxK

U2 - 10.1109/FUZZ-IEEE.2013.6622366

DO - 10.1109/FUZZ-IEEE.2013.6622366

M3 - Conference article published in proceeding or book

SN - 9781479900220

BT - FUZZ-IEEE 2013 - 2013 IEEE International Conference on Fuzzy Systems

T2 - 2013 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2013

Y2 - 7 July 2013 through 10 July 2013

ER -

Three new uncertainty bound methods of Karnik-Mendel algorithms

Abstract

Conference

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this