An Improved FCM Algorithm based on Search Space Smoothing

W. Zhang and F.-C. Sun (PRC)

Keywords

Fuzzy Cmeans algorithm, Search space, Search space smoothing

Abstract

The traditional fuzzy C-means(FCM) algorithm is an optimization algorithm based on gradient descending, it is sensitive to the initial condition and liable to be trapped in a local optimum. Search space smoothing allows a local search heuristics to escape from a poor, local optimum. In this paper, an improved FCM algorithm based on search space smoothing is proposed. By designing a proper smoothing function, we can easily wipe off the most of local optimum point. Experiment result demonstrated that the search space smoothing is very efficient for FCM algorithm, especially in complicated occasions.

Important Links:



Go Back