Skip to main content
SpringerLink
Log in

A boundary restricted adaptive particle swarm optimization for data clustering

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Data clustering is the most popular data analysis method in data mining. It is the method that parts the data object to meaningful groups. It has been applied into many areas such as image processing, pattern recognition and machine learning where the data sets are of many shapes and sizes. The most popular K-means and other classical algorithms suffer from drawback of their initial choice of centroid selection and local optima. This paper presents a new improved algorithm named as Boundary Restricted Adaptive Particle Swam Optimization (BR-APSO) algorithm with boundary restriction strategy. The proposed BR-APSO algorithm is tested on nine data sets, and its results are compared with those of PSO, NM-PSO, K-PSO and K-means clustering algorithms. It has been found that the proposed algorithm is robust, generates more accurate results and its convergence speed is also fast compared to other algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Ahmadi A, Karray F, Kamel M (2007) Multiple cooperating swarms for data clustering. In: Proceedings of IEEE swarm intelligence symposium, pp 206–212

  2. Ahmadyfard A, Modares H (2008) Combining PSO and k-means to enhance data clustering. In: International symposium on telecommunications, pp 688–691

  3. Bandyopadhyay S, Maulik U (2002) An evolutionary technique based on K-means algorithm for optimal clustering in RN. Inf Sci 146:221–237

    Article  MathSciNet  MATH  Google Scholar 

  4. Yang CH, Hsiao CJ, Chuang LY (2010) Accelerated linearly decreasing weight particle swarm optimization for data clustering. Proc Int Multi Conf Eng Comput Sci (Hongkong) 1:1–6

    Google Scholar 

  5. Eberhart RC, Shi Y (2001) Tracking and optimizing dynamic systems with particle swarms. In: Proceedings of the congress on evolutionary computation, Seoul, Korea, pp 94–97

  6. El-abd M, Kamel M (2005) Information exchange in multiple cooperating swarms. In: IEEE swarm intelligence symposium, pp 138–142

  7. Fan S-KS, Liang Y-C, Zahara E (2004) Hybrid simplex search and particle swarm optimization for the global optimization of multimodal functions. Eng Optim 36:401–418

    Article  Google Scholar 

  8. Jain AR, Murthy MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):265–323

    Article  Google Scholar 

  9. Jinxin D, Qi Minyong (2009) A new algorithm for clustering based on particle swarm optimization and K-means. IEEE Int Conf Artif Intell Comput Intell 4:264–268

    Google Scholar 

  10. Kao Yi-Tung, Zahara E, Kao I-Wei (2007) A Hybridized Approach to Data Clustering. Expert Syst Appl 34:1754–1762

  11. Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proc IEEE Int Joint Conf Neural Netw 4:1942–1948

    Article  Google Scholar 

  12. Kennedy J (1997) Minds and Cultures: Particle Swarm Implications. In: Socially Intelligent Agents Papers AAAI Fall Symposium Technical Report FS-97-02, AAAI Press, Menlo Park, pp 67–72

  13. Murthy CA, Chowdhury N (1996) In search of optimal clusters using genetic algorithms. Pattern Recogn Lett 17:825–832

    Article  Google Scholar 

  14. Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7:308–313

    Article  MATH  Google Scholar 

  15. Olsson DM, Nelson LS (1975) The Nelder–Mead simplex procedure for function minimization’. Technometrics 17:45–51

    Article  MATH  Google Scholar 

  16. Paterlini S, Krink T (2006) Differential evolution and particle swarm optimization in partitional clustering’. Comput Stat Data Anal 50:1220–1247

    Article  MathSciNet  Google Scholar 

  17. Rana S, Jasola S, Kumar R (2010) A hybrid sequential approach for data clustering using K-Means and particle swarm optimization algorithm. Int J Eng Sc Technol 2(6):167–176

    Google Scholar 

  18. Rana S, Jasola S, Kumar R (2011) A review on particle swarm optimization algorithm and their application to data clustering. Artificial Intelligence Review Archive 35(3):211–222

    Google Scholar 

  19. Selim SZ, Ismail MA (1984) K-means type algorithms: a generalized convergence theorem and characterization of local opti-mality. IEEE Transact Pattern Anal Mach Intell 6:81–87

    Article  MATH  Google Scholar 

  20. Shi Y, Eberhart, RC (1998) Parameter selection in particle swarm optimization. Evolutionary programming, vol 1441 of lecture notes in computers science, Springer, pp 591–600

  21. Tsai CY, Chiu CC (2008) Developing a feature weight self-adjustment Mechanism for k-means clustering Algorithm. Comput Stat Data Anal 52:4658–4672

    Article  MathSciNet  MATH  Google Scholar 

  22. Zalik KR (2008) An effcient kmeans clustering algorithm. Pattern Recogn Lett 29:1385–1391

    Article  Google Scholar 

  23. Wang XZ, He YL, Dong LC, Zhao HY (2011) Particle swarm optimization for determining fuzzy measures from data. Inf Sci 181(19):4230–4252

    Article  MATH  Google Scholar 

  24. Liang J, Song W (2011) Clustering based on Steiner points. Int J Mach Learn Cyber. doi:10.1007/s13042-011-0047-7

    Google Scholar 

  25. Graaff AJ, Engelbrecht AP (2011) Clustering data in stationary environments with a local network neighborhood artificial immune system. Int J Mach Learn Cyber. doi:10.1007/s13042-011-0041-0

    Google Scholar 

  26. Guo G, Chen S, Chen L (2011) Soft subspace clustering with an improved feature weight self-adjustment mechanism. Int J Mach Learn Cyber. doi:10.1007/s13042-011-0039-7

    Google Scholar 

Download references

Acknowledgments

The authors would like to thank to Erwie Zahara, Department of Industrial Engineering and Management, St. John’s University, Tamsui, Taiwan for providing data set and other help regarding this work.

Author information

Authors and Affiliations

  1. School of ICT, Gautam Buddha University, Greater Noida, India

    S. Rana & S. Jasola

  2. Department of Electrical Engineering, Malaviya National Institute of Technology, Jaipur, India

    R. Kumar

Authors
  1. S. Rana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Jasola
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Kumar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rana, S., Jasola, S. & Kumar, R. A boundary restricted adaptive particle swarm optimization for data clustering. Int. J. Mach. Learn. & Cyber. 4, 391–400 (2013). https://doi.org/10.1007/s13042-012-0103-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-012-0103-y

Keywords

Search

Navigation