Pp. 105-112 (8)
In this chapter we discuss different challenges of using evolutionary
algorithms to optimize the K-means algorithm. One problem is how to handle empty
clusters. In addition, the time complexity of the different algorithms is shown.
Convergence speed, Data representation, Empty clusters, Fitness
measure, Invalid cluster structures, Time complexity.
Bergen University College, Bergen, Norway.