Discrete Particle Swarm Optimization Algorithm for Data Clustering

  • R. Karthi
  • S. Arumugam
  • K. Ramesh Kumar
Part of the Studies in Computational Intelligence book series (SCI, volume 236)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Xu, R., Wunsch II, D.: Survey of Clustering Algorithms. IEEE Transactions on Neural Network 16(3), 645–678 (2005)CrossRefGoogle Scholar
  2. 2.
    Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM computing Survey 31(3), 264–323 (1999)CrossRefGoogle Scholar
  3. 3.
    Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE Press, Piscataway (1995)CrossRefGoogle Scholar
  4. 4.
    Paterlini, S., Krink, T.: Differential evolution and particle swarm optimization in partitional clustering. Computational Statistics& Data Analysis 50(5), 1220–1247 (2006)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Bandyopadhyay, S., Maulik, U.: An evolutionary technique based on k-means algorithm for optimal clustering in Rn. Information Science 146, 221–237 (2002)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bandyopadhyay, S., Murthy, C.A., Pal, S.K.: Pattern classification with genetic algorithm. Pattern recognition letters 16, 801–808 (1995)CrossRefGoogle Scholar
  7. 7.
    Jarboui, B., Cheikh, M., Siarry, P., Rebai, A.: Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Applied Mathematics and Computation 192, 337–345 (2007)CrossRefMathSciNetGoogle Scholar
  8. 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. 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. 10.
    Hoos, H.H., Stutzle, T.: Stochastic Local search: Foundation and Applications. Morgan Kaufmann Publishers, San Francisco (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • R. Karthi
    • 1
  • S. Arumugam
    • 2
  • K. Ramesh Kumar
    • 3
  1. 1.Asst Professor, Department of Computer ScienceAmrita Vishwa Vidyapeetham, IndiaEttimadaiIndia
  2. 2.Chief Executive Officer, Nandha College of EngineeringErodeIndia
  3. 3.Professor, Department of Mechanical EngineeringAmrita Vishwa VidyapeethamIndia

Personalised recommendations