Abstract
In this chapter we make a summary of how to optimize the K-means clustering algorithm based on evolutionary computing. The system is still missing a user interface to handle invalid user input. Parallel coordinates that may be used as a tool to visualize data in high-dimensional spaces is only given a short introduction. In addition, Particle Swarm Optimization (PSO) is also mentioned to find global solutions to optimization problems.
Keywords: Clustering metric, Invalid cluster structures, Overplotting, Parallel coordinates, PSO.
About this chapter
Cite this chapter as:
Terje Kristensen ;Summary and Future Directions, Computational Intelligence, Evolutionary Computing and Evolutionary Clustering Algorithms (2016) 1: 113. https://doi.org/10.2174/9781681082998116010011
DOI https://doi.org/10.2174/9781681082998116010011 |
Publisher Name Bentham Science Publisher |