Efficient clustering with a self-adaptive genetic algorithm

摘要

We give a self-adaptive genetic algorithm (SAGA) for the clustering problem (Kaufman and Rousseeuw, 1990). We assume that the number of clusters is fixed and the objects to be clustered are k-dimensional vectors in an Euclidean space.