Hybrid PSO Algorithm Clustering Analysis Based on K-Means Mutation Operator

This paper presents a hybrid PSO algorithm based on K-Means operator.It combines the locally searching capability of the K-Means algorithm with the global optimization capability of genetic algorithm, and introduces the K-Means operator into the PSO algorithm.It's a hybrid algorithm using symbolic coding, adaptive mutation, and optimal individual retention policies.Simulation results show that the algorithm has effectively overcomes the slow convergence of PSO algorithm and the locality convergence of K-Means algorithm, in order to can get better clustering.