Abstract

Fuzzy C-means (FCM) algorithm is a fuzzy clustering algorithm based on objective function compared with typical “hard clustering” such as k-means algorithm. FCM algorithm calculates the membership degree of each sample to all classes and obtain more reliable and accurate classification results. However, in the process of clustering, FCM algorithm needs to determine the number of clusters manually, and is sensitive to the initial clustering center. It is easy to generate problems such as multiple clustering iterations, slow convergence speed and local optimal solution. To address those problems, we propose to combine the FCM algorithm and DPC (Clustering by fast search and find of density peaks) algorithm. First, DPC algorithm is used to automatically select the center and number of clusters, and then FCM algorithm is used to realize clustering. The comparison experiments show that the improved FCM algorithm has a faster convergence speed and higher accuracy.

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