DocumentCode
2274976
Title
Generation of membership functions via possibilistic clustering
Author
Krishnapuram, Raghu
Author_Institution
Dept. of Electr. & Comput. Eng., Missouri Univ., Columbia, MO, USA
fYear
1994
fDate
26-29 Jun 1994
Firstpage
902
Abstract
Possibilistic clustering has been introduced recently to overcome some of the limitations imposed by the constraint used in the fuzzy c-means algorithm. It was shown that possibilistic memberships correspond more closely to the notion of “typicality”. In this paper, we explore certain interesting properties of possibilistic clustering, In particular, we show that possibilistic clustering can be successfully used to solve two important problems that arise while using fuzzy set theory: i) determination of membership functions, and ii) determination of the number of clusters
Keywords
fuzzy set theory; pattern recognition; possibility theory; fuzzy c-means algorithm; fuzzy set theory; membership function generation; pattern recognition; possibilistic clustering; Blades; Clustering algorithms; Clustering methods; Equations; Fuzzy set theory; Fuzzy sets; Partitioning algorithms; Prototypes; Shape; Training data;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the Third IEEE Conference on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-1896-X
Type
conf
DOI
10.1109/FUZZY.1994.343851
Filename
343851
Link To Document