A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Hybridization of particle swarm optimization with the K-Means algorithm for clustering analysis
2010
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)
Clustering is an unsupervised classification technique which deals with pattern recognition problems. While traditional analytical methods suffer from slow convergence and the challenges of high-dimensional. Recent years, particle swarm optimization (PSO) has successfully been applied to a number of real world clustering problems with the fast convergence and the effectively for high-dimensional data. This paper presents a detailed overview of hybrid algorithms combining PSO with K Means
doi:10.1109/bicta.2010.5645181
dblp:conf/bic-ta/ShenJZZ10
fatcat:5a6pztu7vfdqrkec5apmizifii