R. Baragona, L. Bocci, and C.M. Medaglia
Genetic algorithms, cluster analysis, Monte Carlo simulation, latin square design
In this paper the performance of genetic algorithms for solving some clustering problems is investigated through a simulation experiment. If the number of clusters is known in advance, our results show that the genetic algorithm is able to find the right partition, almost irrespective of the genetic parameters selected. Also, the genetic algorithm always performs favourably with respect to the K-means algorithm. On the other hand, if the number of clusters is unknown, the genetic algorithm provides good results as well. Four versions of the genetic algorithm proposed in the literature are compared, and their performances are not found to differ significantly. However, all algorithms have to be supplied with some reasonable positive integer for the maximum number of clusters. Otherwise, the estimated number of clusters is not very near to the true value. Moreover, if the points are not equally partitioned into clusters, the performances deteriorate considerably. On the contrary, other perturbation sources, such as outliers or data errors, do not affect the results.
Important Links:
Go Back
