Computational Intelligence, Evolutionary Computing and Evolutionary Clustering Algorithms


Author(s): Terje Kristensen

Pp: 105-112 (8)

DOI: 10.2174/9781681082998116010010

* (Excluding Mailing and Handling)


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.

Related Journals
Related Books
© 2024 Bentham Science Publishers | Privacy Policy