An evolutionary approach for the clustering data problem

The clustering problem consists in the discovery of interesting groups in a dataset. Such task is very important and widely tackled in the literature. In this paper, we propose an evolutionary method in order to obtain well formed and spatially separated clusters. The proposed algorithm uses a complete solution representation, each partition is represented by a length-variable chromosome . The variation operators were chosen to facilitate the exchange of clustering information between individuals. We have put two complementary clustering criteria together in the fitness function, so that the method can find clusters with arbitrary shapes. The k-means algorithm was the basis of the local search operator, such operator might refine the clustering solutions. The population diversity was an important issue for the algorithm, so a diversity maintenance scheme was employed. Differently from other existing clustering algorithms, our algorithm does not need the setting of the number of clusters in advance. We evaluated the method in different contexts, using both real and simulated data.