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.
Related Journals
Related Books
Computational Intelligence For Data Analysis
Machine Learning and Its Application: A Quick Guide for Beginners
Applied Machine Learning and Multi-Criteria Decision-Making in Healthcare
A First Course in Artificial Intelligence
Artificial Intelligence: Models, Algorithms and Applications
Advanced Computing Techniques: Implementation, Informatics and Emerging Technologies
Handbook of Mobile Application Development: A Guide to Selecting the Right Engineering and Quality Features
Ad Hoc and Sensor Wireless Networks: Architectures, Algorithms and Protocols
Applications of Modern High Performance Networks
Arduino Meets Matlab: Interfacing, Programs and Simulink