Clustering algorithms for fuzzy rules decomposition
This paper presents the development, testing and evaluation of generalized Possibilistic fuzzy c-means (FCM) algorithms applied to fuzzy sets. Clustering is formulated as a constrained minimization problem, whose solution depends on the constraints imposed on the membership function of the cluster a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/2757 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/2757 |
| Summary: | This paper presents the development, testing and evaluation of generalized Possibilistic fuzzy c-means (FCM) algorithms applied to fuzzy sets. Clustering is formulated as a constrained minimization problem, whose solution depends on the constraints imposed on the membership function of the cluster and on the relevance measure of the fuzzy rules. This fuzzy clustering of fuzzy rules leads to a fuzzy partition of the fuzzy rules, one for each cluster, which corresponds to a new set of fuzzy sub-systems. When applied to the clustering of a flat fuzzy system results a set of decomposed sub-systems that will be conveniently linked into a Hierarchical Prioritized Structures. |
|---|