GeCiM: A Novel Generalized Approach to C-Means Clustering

Abstract

Abstract. All three conventional c-means clustering algorithms have their advantages and disadvantages. This paper presents a novel generalized approach to c-means clustering: the objective function is considered to be a mixture of the FCM, PCM, and HCM objective functions. The optimal solution is obtained via evolutionary computation. Our main goal is to reveal the properties of such mixtures and to formulate some rules that yield accurate partitions.