Abstract
Tree-Seed optimization algorithm (TSA) has certain advantages in solving optimization problems, and the seed generation mechanism can ensure that the global optimal solution is recovered. However, the update method for the tree is a single process that relies solely on the generation and replacement of the seed to complete the update for the parent tree. This approach will inevitably cause the problems of the imbalance between exploration and exploitation, poor population diversity and local stagnation. Inspired by the Butterfly Optimization Algorithm (BOA), a novel hybrid Tree-Seed via Butterfly Optimization Algorithm (TSBA) with double-layer cooperation strategy, including seed-layer with triple-based self-adaption mechanism and Tree-layer with fragrance-guided mechanism, is proposed to improve exploration capability. The proposed TSBA algorithm is then tested on IEEE CEC 2017 benchmark functions, comparing with three types of algorithms, followed by the Wilcoxon signed-rank and Friedman ranking with post-hoc tests. Moreover, the applicability for feature selection is verified by designing bTSBA as a binary version 10 UCI datasets. All experimental results have consistently confirmed that the proposed TSBA algorithm is a promising optimization and provide an effective solution for the optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Disclosure of Interests
The authors have no competing interests to declare that are relevant to the content of this article.
References
Dadvar, M., Navidi, H., Javadi, H.H.S., Mirzarezaee, M.: A cooperative approach for combining particle swarm optimization and differential evolution algorithms to solve single-objective optimization problems. Appl. Intell. 52(4), 4089–4108 (2022)
Banchhor, C., Srinivasu, N.: Integrating cuckoo search-grey wolf optimization and correlative naive bayes classifier with map reduce model for big data classification. Data Knowl. Eng. 127, 101788 (2020)
Gomez, D., Rojas, A.: An empirical overview of the no free lunch theorem and its effect on real-world machine learning classification. Neural Comput. 28(1), 216–228 (2016)
Mortazavi, A., Moloodpoor, M.: Enhanced butterfly optimization algorithm with a new fuzzy regulator strategy and virtual butterfly concept. Knowl.-Based Syst. 228, 107291 (2021)
Kiran, M.S.: TSA: Tree-seed algorithm for continuous optimization. Expert Syst. Appl. 42(19), 6686–6698 (2015)
Arora, S., Singh, S.: Butterfly optimization algorithm: a novel approach for global optimization. Soft. Comput. 3, 1–20 (2018)
Jiang, J., Meng, X., Chen, Y., Qiu, C., Liu, Y., Li, K.: Enhancing Tree-seed algorithm via feed-back mechanism for optimizing continuous problems. Appl. Soft Comput. 92, 106314 (2020)
Sharma, S., Saha, A.K.: M-MBOA: a novel butterfly optimization algorithm enhanced with mutualism scheme. Soft Computing, 1–19 (2019)
Sahman, M.A., Cinar, A.C.: Binary Tree-seed algorithms with s-shaped and v-shaped transfer functions. Int. J. Intell. Syst. Appl. Eng. 7(2), 111–117 (2019)
Zhou, X., et al.: Boosted local dimensional mutation and all-dimensional neighborhood slime mould algorithm for feature selection. Neurocomputing 126467 (2023)
Asuncion, A., Newman, D.: UCI machine learning repository. Irvine, CA, USA(2007)
Tumar, I., Hassouneh, Y., Turabieh, H., Thaher, T.: Enhanced binary moth flame optimization as a feature selection algorithm to predict software fault prediction. IEEE Access 8, 8041–8055 (2020)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: BGSA: binary gravitational search algorithm. Nat. Comput. 9, 727–745 (2010)
Mirjalili, S., Lewis, A.: S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1–14 (2013)
Mirjalili, S., Mirjalili, S.M., Yang, X.-S.: Binary bat algorithm. Neural Comput. Appl. 25, 663–681 (2014)
Faris, H., et al.: An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl.-Based Syst. 154, 43–67 (2018)
Abdel-Basset, M., Mohamed, R., Sallam, K.M., Chakrabortty, R.K., Ryan, M.J.: BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: method and comprehensive analysis. Comput. Ind. Eng. 159, 107469 (2021)
Mafarja, M., Mirjalili, S.: Whale optimization approaches for wrapper feature selection. Appl. Soft Comput. 62, 441–453 (2018)
Abdel-Basset, M., Sallam, K.M., Mohamed, R., Elgendi, I., Munasinghe, K., Elkomy, O.M.: An improved binary grey-wolf optimizer with simulated annealing for feature selection. IEEE Access 9, 139792–139822 (2021)
Acknowledgments
The authors thank the financial support from the Foundation of the Development Project of Jilin Province of China (No. 20200401076GX).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Meng, X. et al. (2024). Enhanced Tree-Seed Algorithm with Double-Layer Cooperation Strategy to Boost Diversity and Exploration Capability for Feature Selection. In: Huang, DS., Zhang, X., Chen, W. (eds) Advanced Intelligent Computing Technology and Applications. ICIC 2024. Lecture Notes in Computer Science, vol 14862. Springer, Singapore. https://doi.org/10.1007/978-981-97-5578-3_20
Download citation
DOI: https://doi.org/10.1007/978-981-97-5578-3_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-5577-6
Online ISBN: 978-981-97-5578-3
eBook Packages: Computer ScienceComputer Science (R0)