A hybrid clustering algorithm based on PSO with dynamic crossover
In order to overcome the premature convergence in particle swarm optimization (PSO), we introduce dynamical crossover, a crossover operator with variable lengths and positions, to PSO, which is briefly denoted as CPSO. To get rid of the drawbacks of only finding the convex clusters and being sensitive to the initial points in \(k\)-means algorithm, a hybrid clustering algorithm based on CPSO is proposed. The difference between the work and the existing ones lies in that CPSO is firstly introduced into \(k\)-means. Experimental results performing on several data sets illustrate that the proposed clustering algorithm can get completely rid of the shortcomings of \(k\)-means algorithms, and acquire correct clustering results. The application in image segmentation illustrates that the proposed algorithm gains good performance.
hybrid clustering pso dynamical crossover \(k\)-means knn