[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

An improved binary particle swarm optimization combing V-shaped and U-shaped transfer function

  • Special Issue
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

Feature selection aims to find a best feature subset from all feature sets of a given dataset, which represents the whole feature space to reduce redundancy and improve classification accuracy. The evolutionary computation algorithm is often applied to feature selection, but there exists low efficiency in the search process. With the increase of the number of features, solving the feature selection problem become more and more difficult. Existing evolutionary algorithms have many defects, such as slow convergence speed, low convergence accuracy and easy to fall into local optimum. Therefore, the research of more effective evolutionary algorithms has important theoretical significance and application value. Binary Particle Swarm Optimization (BPSO) is a kind of evolutionary computation algorithm and has a good performance in feature selection problems. It uses transfer function to convert the continuous search space to the binary one. Transfer function plays an important role in BPSO. So this paper proposes an improved BPSO by combining V-shaped and U-shaped transfer function, and introduces a new learning strategy and a local search strategy based on adaptive mutation. The improved BPSO enhances its optimization ability in feature selection problem. The experimental results show that the improved BPSO has better dimension reduction ability and classification performance than other algorithms.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

All data used to support the findings of the study is included within this paper.

References

  1. Al-Tashi Q et al (2019) Binary optimization using hybrid grey wolf optimization for feature selection. IEEE Access 7:39496–39508

    Article  Google Scholar 

  2. Wu X et al (2020) Supervised feature selection with orthogonal regression and feature weighting. IEEE Trans Neural Netw Learn Syst 99:1–8

    Google Scholar 

  3. Haidi Rao AB et al (2019) Feature selection based on artificial bee colony and gradient boosting decision tree. Appl Soft Comput 74:634–642

    Article  Google Scholar 

  4. Li J, Tang J, Liu H (2017) Reconstruction-based unsupervised feature selection: an embedded approach. In: Twenty-sixth international joint conference on artificial intelligence

  5. Kennedy J, Eberhart R (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, 1995: MHS’95, pp 39–43. https://doi.org/10.1109/MHS.1995.494215

  6. Zhao W, Zhang Z, Wang L (2020) Manta ray foraging optimization: an effective bio-inspired optimizer for engineering applications. Eng Appl Artif Intell 87:103300

    Article  Google Scholar 

  7. Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67

    Article  Google Scholar 

  8. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98

    Article  Google Scholar 

  9. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Article  Google Scholar 

  10. Jia H, Peng X, Lang C (2021) Remora optimization algorithm. Expert Syst Appl 185:115665

    Article  Google Scholar 

  11. Piramuthu S (2004) Evaluating feature selection methods for learning in data mining applications. Eur J Oper Res 156:483–494

    Article  MATH  Google Scholar 

  12. Gunal S, Edizkan R (2008) Subspace based feature selection for pattern recognition. Inf Sci 178:3716–3726

    Article  Google Scholar 

  13. Li YZ, Jiang L, Wu Q, Wang P, Gooi HB, Li K et al (2017) Wind thermal power system dispatch using MLSAD model and GSOICLW algorithm. Knowl-Based Syst 116:94–101

    Article  Google Scholar 

  14. Shen Y, Wang G, Liu Q (2011) Correlative particle swarm optimization for multi-objective problems. In: Advances in swarm intelligence: second international conference, ICSI 2011, Chongqing, China, 12–15 June 2011, proceedings, Part II. Springer

  15. Eberhart R, Kennedy J (2002) A new optimizer using particle swarm theory. In: Mhs95 sixth international symposium on micro machine & human science. IEEE

  16. Li AD, Xue B, Zhang M (2021) Improved binary particle swarm optimization for feature selection with new initialization and search space reduction strategies. Appl Soft Comput 106:107302

    Article  Google Scholar 

  17. Song XF, Zhang Y, Gong DW et al (2021) Feature selection using bare-bones particle swarm optimization with mutual information. Pattern Recognit 112:107804

    Article  Google Scholar 

  18. Beheshti Z, Shamsuddin SM, Hasan S (2015) Memetic binary particle swarm optimization for discrete optimization problems. Inf Sci (NY) 299:58–84

    Article  Google Scholar 

  19. Shen Q et al (2004) Modified particle swarm optimization algorithm for variable selection in MLR and PLS modeling: QSAR studies of antagonism of angiotensin II antagonists. Eur J Pharm Sci 22(2–3):145–152

    Article  Google Scholar 

  20. Wang L, Wang SY, Ye X (2012) An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem. Expert Syst Appl 39(5):5593–5599

    Article  Google Scholar 

  21. Chuang L-Y, Chang H-W, Tu C-J, Yang C-H (2008) Improved binary PSO for feature selection using gene expression data. Comput Biol Chem 32:29–38

    Article  MATH  Google Scholar 

  22. Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1–14. https://doi.org/10.1016/j.swevo.2012.09.002

    Article  Google Scholar 

  23. Mirjalili S, Zhang H, Mirjalili S, Chalup S, Noman N (2020) A novel U-shaped transfer function for binary particle swarm optimisation. In: Nagar A, Deep K, Bansal J, Das K (eds) Soft Computing for Problem Solving 2019. Advances in Intelligent Systems and Computing, vol 1138. Springer, Singapore. https://doi.org/10.1007/978-981-15-3290-0_19

  24. Guo S-S, Wang J-S, Guo M-W (2020) Z-shaped transfer functions for binary particle swarm optimization algorithm. Comput Intell Neurosci 2020:6502807

    Article  Google Scholar 

  25. Beheshti Z (2020) A novel x-shaped binary particle swarm optimization. Soft Comput 25:3013–3042

    Article  MATH  Google Scholar 

  26. Islam MJ, Li X, Mei Y (2017) A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO. Appl Soft Comput 59:182–196

    Article  Google Scholar 

  27. Nezamabadi-Pour H, Rostami-Sharbabaki M, Maghfoori-Farsangi M (2008) Binary particle swarm optimization: challenges and new solutions. CSI J Comput Sci Eng 6:21–32

    Google Scholar 

  28. Sedighizadeh D, Masehian E, Sedighizadeh M et al (2020) GEPSO: a new generalized particle swarm optimization algorithm. Math Comput Simul 179:194–212

    Article  MathSciNet  MATH  Google Scholar 

  29. Blake CL, Merz CJ (1998) UCI repository of machine learning databases. University of California, Irvine, Irvine, CA, USA, Technical report

  30. Aličković E, Subasi A (2017) Breast cancer diagnosis using GA feature selection and rotation forest. Neural Comput Appl 28(4):753–763

    Article  Google Scholar 

  31. Rodrigues D, Pereira LA, Almeida T, Papa JP, Souza A, Ramos CC et al (2013) BCS: a binary cuckoo search algorithm for feature selection. In: IEEE international symposium on circuits and systems. IEEE, pp 465–468

  32. Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium, MHS’95. IEEE pp 39–43

Download references

Funding

This work is supported in part by the National Natural Science Foundation of China (No. 62172095) and in part by Fujian University of Technology Development Fund (No. GY-Z20046)

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Yuxiang Chen or Jianhua Liu.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Y., Liu, J., Zhu, J. et al. An improved binary particle swarm optimization combing V-shaped and U-shaped transfer function. Evol. Intel. 16, 1653–1666 (2023). https://doi.org/10.1007/s12065-023-00819-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-023-00819-1

Keywords

Navigation