Skip to main content

Binary Flying Squirrel Optimizer for Feature Selection

  • Conference paper
  • First Online:
Intelligent Systems (BRACIS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14197))

Included in the following conference series:

  • 215 Accesses

Abstract

Bio-inspired optimization algorithms aim to address the most diverse problems without the need for derivatives, and they are independent of the shape of the search space. The Flying Squirrel Optimizer belongs to the family of bio-inspired algorithms and simulates the movement of flying squirrels from tree to tree in search of food. This paper proposes a binary version of the flying squirrel optimizer for feature selection problems. To elucidate the performance of the proposed algorithm, we employed six other well-known bio-inspired algorithms for comparison purposes in sixteen benchmark datasets widely known in the literature. Furthermore, we employ the binary flying squirrel optimizer in selecting gas concentrations to identify faults in power transformers. The results expressed that Binary Flying Squirrell Optimizer can either find compact feature sets or improve classification effectiveness, corroborating its robustness.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://archive.ics.uci.edu/.

  2. 2.

    It is worthy to say that any other supervised classifier can be used. We recommend models that figure a reasonably efficient training step, for the fitness function might be evaluated several times during the optimization process.

  3. 3.

    The algorithms used for comparison purposes and FSO are part of Opytimizer library, which contains several implementations of metaheuristics in Python. The Opytimizer library is available in: https://github.com/gugarosa/opytimizer.

References

  1. IEC 60599:2022 Mineral oil-filled electrical equipment in service - Guidance on the interpretation of dissolved and free gases analysis. IEC, Geneva, Switzerland, 4 edn. (2022)

    Google Scholar 

  2. Arora, S., Singh, S.: Butterfly optimization algorithm: a novel approach for global optimization. Soft. Comput. 23(3), 715–734 (2019). https://doi.org/10.1007/s00500-018-3102-4

    Article  Google Scholar 

  3. Azizyan, G., Miarnaeimi, F., Rashki, M., Shabakhty, N.: Flying squirrel optimizer (FSO): A novel SI-based optimization algorithm for engineering problems. Iranian J. Optimiz. 11(2), 177–205 (2019)

    Google Scholar 

  4. Chou, J.S., Truong, D.N.: A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean. Appl. Math. Comput. 389, 125535 (2021)

    MathSciNet  MATH  Google Scholar 

  5. Equbal, M.D., Khan, S.A., Islam, T.: Transformer incipient fault diagnosis on the basis of energy-weighted dga using an artificial neural network. Turk. J. Electr. Eng. Comput. Sci. 26(1), 77–88 (2018)

    Article  Google Scholar 

  6. Falcón, R., Almeida, M., Nayak, A.: Fault identification with binary adaptive fireflies in parallel and distributed systems. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1359–1366. IEEE (2011)

    Google Scholar 

  7. Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 32(200), 675–701 (1937)

    Article  MATH  Google Scholar 

  8. Friedman, M.: A comparison of alternative tests of significance for the problem of m rankings. Ann. Math. Stat. 11(1), 86–92 (1940)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, vol. 5, pp. 4104–4108 (1997)

    Google Scholar 

  10. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995-International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE (1995)

    Google Scholar 

  11. Li, L., Pan, J.S., Zhuang, Z., Chu, S.C.: A novel feature selection algorithm based on aquila optimizer for covid-19 classification. In: Shi, Z., Zucker, J.D., An, B. (eds.) Intelligent Information Processing XI, pp. 30–41. Springer International Publishing, Cham (2022). https://doi.org/10.1007/978-3-031-03948-5_3

    Chapter  Google Scholar 

  12. Mantegna, R.N.: Fast, accurate algorithm for numerical simulation of lévy stable stochastic processes. Phys. Rev. E 49, 4677–4683 (1994)

    Article  Google Scholar 

  13. Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016). https://doi.org/10.1016/j.advengsoft.2016.01.008

    Article  Google Scholar 

  14. Nakamura, R.Y.M., Pereira, L.A.M., Costa, K.A., Rodrigues, D., Papa, J.P., Yang, X.S.: BBA: a binary bat algorithm for feature selection. In: 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images, pp. 291–297 (2012)

    Google Scholar 

  15. Nemenyi, P.: Distribution-free Multiple Comparisons. Princeton University (1963)

    Google Scholar 

  16. Rodrigues, D., et al.: BCS: a binary cuckoo search algorithm for feature selection. In: IEEE International Symposium on Circuits and Systems, pp. 465–468 (2013)

    Google Scholar 

  17. Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bull. 1(6), 80–83 (1945)

    Article  Google Scholar 

  18. Yang, X.S.: Flower pollination algorithm for global optimization. In: International conference on Unconventional Computing and Natural Computation, pp. 240–249. Springer (2012). https://doi.org/10.1007/978-3-031-03948-5_3

  19. Yang, X.S., Gandomi, A.H.: Bat algorithm: a novel approach for global engineering optimization. Eng. Comput. (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Douglas Rodrigues .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

de Oliveira Sementille, L.F.M., Rodrigues, D., de Souuza, A.N., Papa, J.P. (2023). Binary Flying Squirrel Optimizer for Feature Selection. In: Naldi, M.C., Bianchi, R.A.C. (eds) Intelligent Systems. BRACIS 2023. Lecture Notes in Computer Science(), vol 14197. Springer, Cham. https://doi.org/10.1007/978-3-031-45392-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45392-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45391-5

  • Online ISBN: 978-3-031-45392-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics