Advertisement

A novel parallel object-tracking behavior algorithm based on dynamics for data clustering

  • Xiang FengEmail author
  • Zhaolin Lai
  • Huiqun Yu
Methodologies and Application
  • 43 Downloads

Abstract

Recently, many evolutionary algorithms (EAs) have been used to solve clustering problem. However, compared to K-means which is a simple and fast clustering algorithm, these EA-based clustering algorithms take too much computation time. In addition, the parameters of most EAs are fixed or dynamical adjustment by a simple method on different datasets, and it will cause that the performance of these algorithms is good on some datasets but bad on others. In order to overcome these disadvantages, a novel parallel object-tracking behavior algorithm (POTBA) based on dynamics is proposed in this paper. The proposed algorithm consists of three different models which are parallel object-tracking model, parameters self-learning model and energy model, respectively. First, the parallel object-tracking model is designed to accelerate the computation speed and avoid local minima. Second, the parameters of POTBA are self-adjusted by the parameters self-learning model. Third, the energy model is introduced to depict energy changes of POTBA during the evolutionary process. The correctness and convergence properties of POTBA are analyzed theoretically. Moreover, the effectiveness and parallelism of POTBA are evaluated through several standard datasets, and the experimental results demonstrate that POTBA exhibits superior overall performance than five other state-of-the-art algorithms. In the aspect of search performance, the results of POTBA are better than other comparison algorithms on most used datasets. In the aspect of time performance, the time overhead of POTBA is significantly reduced through parallel computing. When the number of processors increases to 32, the computation time of POTBA is less or close to K-means which is the fastest comparison algorithm.

Keywords

Parallel Object tracking Clustering Parameters self-learning Energy 

Notes

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61772200, 61772201 and 61602175, the Information Development Special Funds of Shanghai Economic and Information Commission under Grant No. 201602008.

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest. This article does not contain any studies with human participants or animals performed by any of the authors. Informed consent was obtained from all individual participants included in the study.

References

  1. Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 1:1–23Google Scholar
  2. Abualigah LM, Khader AT, Al-Betar MA, Gandomi AH (2017) A novel hybridization strategy for krill herd algorithm applied to clustering techniques. Appl Soft Comput 60:423–435CrossRefGoogle Scholar
  3. Abualigah LM, Khader AT, Hanandeh ES (2018) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 5:1–25Google Scholar
  4. Amiri B, Fathian M, Maroosi A (2009) Removed: application of shuffled frog-leaping algorithm on clustering. Int J Adv Manuf Technol 45(1–2):199–209CrossRefGoogle Scholar
  5. Barbakh WA, Wu Y, Fyfe C (2009) Review of clustering algorithms. Springer, BerlinCrossRefGoogle Scholar
  6. Bassiou N, Kotropoulos C (2011) Long distance bigram models applied to word clustering. Pattern Recognit 44(1):145–158zbMATHCrossRefGoogle Scholar
  7. Berikov V (2014) Weighted ensemble of algorithms for complex data clustering. Elsevier Science Inc., AmsterdamCrossRefGoogle Scholar
  8. Carmona CJ, Ramłrez-Gallego S, Torres F, Bernal E, Del Jesus MJ, Garcła S (2012) Web usage mining to improve the design of an e-commerce website: Orolivesur.com. Expert Syst Appl 39(12):11243–11249CrossRefGoogle Scholar
  9. Cheng R, Jin Y (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191CrossRefGoogle Scholar
  10. Chin DD, Lentink D (2017) How birds direct impulse to minimize the energetic cost of foraging flight. Sci Adv 3(5):e1603041CrossRefGoogle Scholar
  11. Cura T (2012) A particle swarm optimization approach to clustering. Expert Syst Appl 39(1):1582–1588CrossRefGoogle Scholar
  12. Derrac J, Garcła S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRefGoogle Scholar
  13. Donovan MS (2013) Generating improvement through research and development in education systems. Science 340(6130):317–319CrossRefGoogle Scholar
  14. Dowlatshahi MB, Nezamabadi-Pour H (2014) Ggsa: a grouping gravitational search algorithm for data clustering. Eng Appl Artif Intell 36:114–121CrossRefGoogle Scholar
  15. Dunsmoor JE, Murty VP, Davachi L, Phelps EA (2015) Emotional learning selectively and retroactively strengthens memories for related events. Nature 520(7547):345CrossRefGoogle Scholar
  16. Feng X, Lau FCM, Yu H (2013) A novel bio-inspired approach based on the behavior of mosquitoes. Inf Sci 233(2):87–108MathSciNetzbMATHCrossRefGoogle Scholar
  17. Feng X, Wang Y, Yu H, Luo F (2017) A novel intelligence algorithm based on the social group optimization behaviors. IEEE Trans Syst Man Cybern Syst PP(99):1–12Google Scholar
  18. Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222(3):175–184MathSciNetCrossRefGoogle Scholar
  19. Hatamlou A, Abdullah S, Nezamabadi-Pour H (2011) Application of gravitational search algorithm on data clustering. In: International conference on rough sets and knowledge technology, pp 337–346Google Scholar
  20. Hruschka ER, Campello RJGB, Freitas AA (2009) A survey of evolutionary algorithms for clustering. IEEE Trans Syst Man Cybern Part C 39(2):133–155CrossRefGoogle Scholar
  21. Jain AK (2008) Data clustering: 50 years beyond k-means. Springer, BerlinGoogle Scholar
  22. Jiang B, Wang N, Wang L (2013) Particle swarm optimization with age-group topology for multimodal functions and data clustering. Commun Nonlinear Sci Numer Simul 18(11):3134–3145MathSciNetzbMATHCrossRefGoogle Scholar
  23. Jun S, Park SS, Jang DS (2014) Document clustering method using dimension reduction and support vector clustering to overcome sparseness. Expert Syst Appl 41(7):3204–3212CrossRefGoogle Scholar
  24. Kao YT, Zahara E, Kao IW (2008) A hybridized approach to data clustering. Expert Syst Appl 34(3):1754–1762CrossRefGoogle Scholar
  25. Karaboga D, Ozturk C (2011) A novel clustering approach: artificial bee colony (abc) algorithm. Appl Soft Comput 11(1):652–657CrossRefGoogle Scholar
  26. Krishnasamy G, Kulkarni AJ, Paramesran R (2014) A hybrid approach for data clustering based on modified cohort intelligence and k-means. Expert Syst Appl 41(13):6009–6016CrossRefGoogle Scholar
  27. Mann PS, Singh S (2017) Improved artificial bee colony metaheuristic for energy-efficient clustering in wireless sensor networks. Artif Intell Rev 14:1–26Google Scholar
  28. Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the cec’2005 special session on real parameter optimization. J Heuristics 15(6):617–644zbMATHCrossRefGoogle Scholar
  29. Nanda SJ, Panda G (2014) A survey on nature inspired metaheuristic algorithms for partitional clustering. Swarm Evol Comput 16:1–18CrossRefGoogle Scholar
  30. Niknam T, Amiri B (2010) An efficient hybrid approach based on PSO, ACO and k -means for cluster analysis. Appl Soft Comput J 10(1):183–197CrossRefGoogle Scholar
  31. Portela NM, Cavalcanti GDC, Ren TI (2014) Semi-supervised clustering for mr brain image segmentation. Expert Syst Appl 41(4):1492–1497CrossRefGoogle Scholar
  32. Rana S, Jasola S, Kumar R (2011) A review on particle swarm optimization algorithms and their applications to data clustering. Artif Intell Rev 35(3):211–222CrossRefGoogle Scholar
  33. Sharma A, Sharma A, Panigrahi BK, Kiran D, Kumar R (2016) Ageist spider monkey optimization algorithm. Swarm Evol Comput 28:58–77CrossRefGoogle Scholar
  34. Shopon M, Adnan MA, Mridha MF (2017) Krill herd based clustering algorithm for wireless sensor networks. In: International workshop on computational intelligence, pp 96–100Google Scholar
  35. Squillero G, Tonda AP (2017) Divergence of character and premature convergence: a survey of methodologies for promoting diversity in evolutionary optimization. Inf Sci 329:782–799CrossRefGoogle Scholar
  36. Van der Merwe DW, Engelbrecht AP (2004) Data clustering using particle swarm optimization. In: The 2003 congress on evolutionary computation, vol 1, 2003. CEC ’03. pp 215–220Google Scholar
  37. Wang Z, Lu R, Chen D, Zou F (2016) An experience information teaching–clearning-based optimization for global optimization. IEEE Trans Syst Man Cybern Syst 46(9):1202–1214CrossRefGoogle Scholar
  38. Xiang WL, Zhu N, Ma SF, Meng XL, An MQ (2015) A dynamic shuffled differential evolution algorithm for data clustering. Neurocomputing 158:144–154CrossRefGoogle Scholar
  39. Yan X, Zhu Y, Zou W, Wang L (2012) A new approach for data clustering using hybrid artificial bee colony algorithm. Neurocomputing 97(1):241–250CrossRefGoogle Scholar
  40. Yang CC, Ng TD (2011) Analyzing and visualizing web opinion development and social interactions with density-based clustering. IEEE Trans Syst Man Cybern Part A Syst Hum 41(6):1144–1155CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringEast China University of Science and TechnologyShanghaiChina
  2. 2.Shanghai Engineering Research Center of Smart EnergyShanghaiChina

Personalised recommendations