Abstract

In this study, the concepts of competitive agglomeration clustering algorithm is incorporated into fuzzy c-means (FCM) clustering algorithm for symbolic interval-values data. In the proposed approach, called as IFCMwUNC clustering algorithm, the problems of the unknown clusters number and the initialization of prototypes in the FCM clustering algorithm for symbolic interval-values data are overcome and discussed. Due to the competitive agglomeration clustering algorithm possess the advantages of the hierarchical clustering algorithm and the partitional clustering algorithm, IFCMwUNC clustering algorithm can be fast converges in a few iterations regardless of the initial number of clusters. Moreover, it is also converges to the same optimal partition regardless of its initialization. Experiments results show the merits and usefulness of IFCMwUNC clustering algorithm for the symbolic interval-values data.

Full Text
Paper version not known

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