DocumentCode
3213771
Title
Fuzzy and possibilistic clustering algorithms based on generalized reformulation
Author
Karayiannis, Nicolaos B.
Author_Institution
Dept. of Electr. & Comput. Eng., Houston Univ., TX, USA
Volume
2
fYear
1996
fDate
8-11 Sep 1996
Firstpage
1393
Abstract
This paper presents a new approach to fuzzy and possibilistic clustering based on reformulation. The reformulation of fuzzy c-means (FCM) algorithms provides the basis for reformulating entropy constrained fuzzy clustering (ECFC) algorithms. This paper also proposes a generalized reformulation function and interprets both FCM and ECFC algorithms as special cases of the broad family of fuzzy and possibilistic clustering algorithms resulting from this approach. New clustering algorithms are also developed and compared experimentally with FCM and ECFC algorithms
Keywords
entropy; fuzzy set theory; minimisation; pattern recognition; possibility theory; entropy constrained fuzzy clustering algorithms; fuzzy c-means algorithms; possibilistic clustering algorithms; Clustering algorithms; Entropy; Equations; Fuzzy sets; Minimization methods; Probability; Prototypes; Temperature sensors; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems, 1996., Proceedings of the Fifth IEEE International Conference on
Conference_Location
New Orleans, LA
Print_ISBN
0-7803-3645-3
Type
conf
DOI
10.1109/FUZZY.1996.552380
Filename
552380
Link To Document