Analysis and efficient implementation of a linguistic fuzzy C-means
This paper is concerned with a linguistic fuzzy C-means (FCM) algorithm with vectors of fuzzy numbers as inputs. This algorithm is based on the extension principles and the decomposition theorem. It turns out that using the extension principle to extend the capability of the standard membership upda...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-0036802259&partnerID=40&md5=71ef7671c5926787edc526fca285261b http://cmuir.cmu.ac.th/handle/6653943832/1365 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| Summary: | This paper is concerned with a linguistic fuzzy C-means (FCM) algorithm with vectors of fuzzy numbers as inputs. This algorithm is based on the extension principles and the decomposition theorem. It turns out that using the extension principle to extend the capability of the standard membership update equation to deal with a linguistic vector has a huge computational complexity. In order to cope with this problem, an efficient method based on fuzzy arithmetic and optimization has been developed and analyzed. We also carefully examine and prove that the algorithm behaves in a way similar to the FCM in the degenerate linguistic case. Synthetic data sets and the iris data set have been used to illustrate the behavior of this linguistic version of the FCM. |
|---|