Discrete Particle Swarm Optimization Algorithm for Data Clustering
In this paper, a novel Discrete Particle Swarm Optimization Algorithm (DPSOA) for data clustering has been proposed. The particle positions and velocities are defined in a discrete form. The DPSOA algorithm uses of a simple probability approach to construct the velocity of particle followed by a search scheme to constructs the clustering solution. DPSOA algorithm has been applied to solve the data clustering problems by considering two performance metrics, such as TRace Within criteria (TRW) and Variance Ratio Criteria (VRC). The results obtained by the proposed algorithm have been compared with the published results of Basic PSO (B-PSO) algorithm, Genetic Algorithm (GA), Differential Evolution (DE) algorithm and Combinatorial Particle Swarm Optimization (CPSO) algorithm. The performance analysis demonstrates the effectiveness of the proposed algorithm in solving the partitional data clustering problems.
Unable to display preview. Download preview PDF.
- 8.Orman, M.G.H., Salman, A., Engelbrecht, A.P.: Dynamic clustering using Particle Swarm Optimization with application in image segmentation. Pattern Analysis and Application 8(4), 332–344 (2005)Google Scholar
- 9.Kennedy, J., Eberhart, R.: A Discrete Binary Version of Particle Swarm Algorithm. In: Proceedings of the Conference on Systems, Man and Cybernetics, pp. 4104–4109 (1997)Google Scholar
- 10.Hoos, H.H., Stutzle, T.: Stochastic Local search: Foundation and Applications. Morgan Kaufmann Publishers, San Francisco (2004)Google Scholar