Abstract

Clustering is the process of dividing data clusters into fragmented clusters so that the same set of data is similar, but the data of different clusters is different. The basis of the fuzzy clustering algorithms is the c-means families and the strongest algorithm is the fuzzy c-means algorithm. However, the fuzzy c-means algorithm is sensitive to outliers. In this study, on the real data set we examined three different algorithms -possibilistic c-means algorithm (PCM), fuzzy possibilistic c-means (FPCM) and possibilistic fuzzy c- means algorithm (PFCM)- which are developed to overcome the unfavorable side of the FCM algorithm. To compare these algorithms, iteration numbers and completion times were calculated.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call