Version 1
: Received: 6 May 2024 / Approved: 7 May 2024 / Online: 8 May 2024 (15:26:26 CEST)
How to cite:
Al-Eiadeh, M. R.; Qaddoura, R.; Abdallah, M. Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature Selection. Preprints2024, 2024050441. https://doi.org/10.20944/preprints202405.0441.v1
Al-Eiadeh, M. R.; Qaddoura, R.; Abdallah, M. Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature Selection. Preprints 2024, 2024050441. https://doi.org/10.20944/preprints202405.0441.v1
Al-Eiadeh, M. R.; Qaddoura, R.; Abdallah, M. Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature Selection. Preprints2024, 2024050441. https://doi.org/10.20944/preprints202405.0441.v1
APA Style
Al-Eiadeh, M. R., Qaddoura, R., & Abdallah, M. (2024). Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature Selection. Preprints. https://doi.org/10.20944/preprints202405.0441.v1
Chicago/Turabian Style
Al-Eiadeh, M. R., Raneem Qaddoura and Mustafa Abdallah. 2024 "Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature Selection" Preprints. https://doi.org/10.20944/preprints202405.0441.v1
Abstract
High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.
Keywords
Feature Selection; Wrapper Feature Selection; Black Hole Algorithm; Cuckoo Search Algorithm; Correlation Functions; Transfer Function; Data Mining
Subject
Computer Science and Mathematics, Artificial Intelligence and Machine Learning
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
