Abstract
Fuzzy c-means clustering algorithm (FCM) often used in pattern recognition is an important method that has been successfully used in large amounts of practical applications. The FCM algorithm assumes that the significance of each data point is equal, which is obviously inappropriate from the viewpoint of adaptively adjusting the importance of each data point. In this paper, considering the different importance of each data point, a new clustering algorithm based on FCM is proposed, in which an adaptive weight vector W and an adaptive exponent p are introduced and the optimal values of the fuzziness parameter m and adaptive exponent p are determined by SA-PSO when the objective function reaches its minimum value. In this method, the particle swarm optimization (PSO) is integrated with simulated annealing (SA), which can improve the global search ability of PSO. Experimental results have demonstrated that the proposed algorithm can avoid local optima and significantly improve the clustering performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.