2692-4048ISSN (Online)
2770-0070ISSN (Print)
Volume 18 , Issue 2 , PP: 157-168, 2025 | Cite this article as | XML | Html | PDF | Full Length Article
Zaynab Ayham Almishlih 1 * , Omar Saber Qasim 2 , Zakariya Yahya Algamal 3
Doi: https://doi.org/10.54216/FPA.180212
Organizations use fusion data modeling to integrate multiple data sources and build precise representations that achieve better organizational clarity. One recent method that has proven effective in many benchmark tests is the arithmetic optimization algorithm (AOA). AOA applies basic distribution behavior to arithmetic operations such as multiplication, division, addition, and subtraction. This paper focuses on the innovative application of AOA in addressing the feature selection problem. The binary version of this algorithm (BAOA) is introduced to solve problems of binary nature. The main part of this version is the transfer function that converts a continuous search space into a discrete search space. Therefore, a new Fountain-shaped transfer function is proposed to enhance global exploration and local exploitation in the BAOA algorithm. The performance of the proposed Fountain-shaped transfer function has been compared with V-shaped and S-shaped transfer functions. Based on ten public datasets, the performance of the proposed transfer function is validated. The Experimental results show the superiority of the proposed Fountain-shaped transfer function not only in getting high classification accuracy with few selected features but also requires inexpensive computational costs.
Feature selection , Transfer function , Bnary optimization algorithm , Arithmetic optimization algorithm , Fountain-shaped transfer function , Data fusion
[1] A. P. Punnen, P. Pandey, and M. Friesen, "Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems," Comput. Oper. Res., vol. 112, p. 104769, 2019.
[2] J. Staunstrup and W. Wolf, Hardware/software co-design: Principles and practice. Springer, 2013.
[3] C. Revelle and K. Hogan, "The maximum reliability location problem and α-reliable p-center problem: Derivatives of the probabilistic location set covering problem," Ann. Oper. Res., vol. 18, no. 1, pp. 155–173, 1989.
[4] H. Marchand and L. A. Wolsey, "The 0-1 knapsack problem with a single continuous variable," Math. Program., vol. 85, pp. 15–33, 1999.
[5] A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouses," Manag. Sci., vol. 9, no. 4, pp. 643–666, 1963.
[6] M. S. Kiran, "The continuous artificial bee colony algorithm for binary optimization," Appl. Soft Comput., vol. 33, pp. 15–23, 2015.
[7] B. Jayalakshmi and A. Singh, "A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem," Int. J. Mach. Learn. Cybern., vol. 8, pp. 691–697, 2017.
[8] R. A. Ibrahim et al., "An opposition-based social spider optimization for feature selection," Soft Comput., vol. 23, pp. 13547–13567, 2019.
[9] D. Du, K.-I. Ko, and X. Hu, Design and analysis of approximation algorithms, vol. 62. Springer, 2012.
[10] T. Dokeroglu, E. Sevinc, and A. Cosar, "Artificial bee colony optimization for the quadratic assignment problem," Appl. Soft Comput., vol. 76, pp. 595–606, 2019.
[11] H. Djelloul, S. Sabba, and S. Chikhi, "Binary bat algorithm for graph coloring problem," in Proc. 2014 2nd World Conf. Complex Syst. (WCCS), 2014, pp. 1–6.
[12] G. B. Dantzig, "Discrete-variable extremum problems," Oper. Res., vol. 5, no. 2, pp. 266–288, 1957.
[13] M. Büther and D. Briskorn, "Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem," Int. J. Oper. Res. Inf. Syst., vol. 3, no. 1, pp. 1–12, 2012.
[14] B. Tran, B. Xue, and M. Zhang, "Genetic programming for multiple-feature construction on high-dimensional classification," Pattern Recognit., vol. 93, pp. 404–417, 2019.
[15] H. Jia et al., "Spotted hyena optimization algorithm with simulated annealing for feature selection," IEEE Access, vol. 7, pp. 71943–71962, 2019.
[16] C. E. M. Qiu, "A novel multi-swarm particle swarm optimization for feature selection," Genet. Program., vol. 20, no. 4, pp. 503–529, 2019.
[17] L. Abualigah et al., "The arithmetic optimization algorithm," Comput. Methods Appl. Mech. Eng., vol. 376, p. 113609, 2021.
[18] M. Xu et al., "Binary arithmetic optimization algorithm for feature selection," Soft Comput., 2023.
[19] L. K. Panwar et al., "Binary grey wolf optimizer for large scale unit commitment problem," Swarm Evol. Comput., vol. 38, pp. 251–266, 2018.
[20] S. Reddy K et al., "Binary whale optimization algorithm: A new metaheuristic approach for profit-based unit commitment problems in competitive electricity markets," Eng. Optim., vol. 51, no. 3, pp. 369–389, 2019.
[21] A. G. Hussien et al., "New binary whale optimization algorithm for discrete optimization problems," Eng. Optim., vol. 52, no. 6, pp. 945–959, 2020.
[22] Y. He et al., "Novel binary differential evolution algorithm based on Taper-shaped transfer functions for binary optimization problems," Swarm Evol. Comput., vol. 69, p. 101022, 2022.
[23] G. Hu et al., "An enhanced hybrid arithmetic optimization algorithm for engineering applications," Comput. Methods Appl. Mech. Eng., vol. 394, p. 114901, 2022.
[24] J. Kennedy and R. C. Eberhart, "A discrete binary version of the particle swarm algorithm," in Proc. 1997 IEEE Int. Conf. Syst. Man Cybern., 1997, pp. 4104–4108.
[25] O. S. Qasim and Z. Y. Algamal, "Feature selection using different transfer functions for binary bat algorithm," Int. J. Math. Eng. Manag. Sci., vol. 5, no. 4, p. 697, 2020.
[26] S. Mirjalili and A. Lewis, "S-shaped versus V-shaped transfer functions for binary particle swarm optimization," Swarm Evol. Comput., vol. 9, pp. 1–14, 2013.
[27] M. Mafarja et al., "S-shaped vs. V-shaped transfer functions for ant lion optimization algorithm in feature selection problem," in Proc. Int. Conf. Future Netw. Distrib. Syst., 2017.
[28] M. Mafarja et al., "Binary dragonfly optimization for feature selection using time-varying transfer functions," Knowl.-Based Syst., vol. 161, pp. 185–204, 2018.
[29] J. Liu et al., "A binary differential search algorithm for the 0–1 multidimensional knapsack problem," Appl. Math. Model., vol. 40, no. 23–24, pp. 9788–9805, 2016.
[30] K. K. Ghosh et al., "Binary social mimic optimization algorithm with x-shaped transfer function for feature selection," IEEE Access, vol. 8, pp. 97890–97906, 2020.
[31] A. Frank, "UCI machine learning repository," 2010. [Online]. Available: http://archive.ics.uci.edu/ml.
