High performance clustering with differential evolution
Sandra Paterlini, Thiemo Krink · 2005
Partitional clustering poses a NP hard search problem for non-trivial problems. While genetic algorithms (GA) have been very popular in the clustering field, particle swarm optimization (PSO) and differential evolution (DE) are rather unknown. We report results of a performance comparison between a GA, PSO and DE for a medoid evolution clustering approach. Our results show that DE is clearly and consistently superior compared to GAs and PSO, both in respect to precision and robustness of the results for hard clustering problems. We conclude that DE rather than GAs should be primarily considered for tackling partitional clustering problems with numerical optimization.