Computational Intelligence, Evolutionary Computing and Evolutionary Clustering Algorithms

This brief text presents a general guideline for writing advanced algorithms for solving engineering and data visualization problems. The book starts with an introduction to the concept of ...
[view complete introduction]

US $
15

*(Excluding Mailing and Handling)



Discussion

Pp. 105-112 (8)

Terje Kristensen

Abstract

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.

Keywords:

Convergence speed, Data representation, Empty clusters, Fitness measure, Invalid cluster structures, Time complexity.

Affiliation:

Bergen University College, Bergen, Norway.