1 January 2020 in IEEE Access
Feature selection (FS), an important pre-processing step in the fields of machine learning and data mining, has immense impact on the outcome of the corresponding learning models. Basically, it aims to remove all possible irrelevant as well as redundant features from a feature vector, thereby enhancing the performance of the overall prediction or classification model. Over the years, meta-heuristic optimization techniques have been applied for FS, as these are able to overcome the limitations of traditional optimization approaches. In this work, we introduce a binary variant of the recently-proposed Sailfish Optimizer (SFO), named as Binary Sailfish (BSF) optimizer, to solve FS problems. Sigmoid transfer function is utilized here to map the continuous search space of SFO to a binary one. In order to improve the exploitation ability of the BSF optimizer, we amalgamate another recently proposed meta-heuristic algorithm, namely adaptive β-hill climbing (AβHC) with BSF optimizer. The proposed BSF and AβBSF algorithms are applied on 18 standard UCI datasets and compared with 10 state-of-the-art meta-heuristic FS methods. The results demonstrate the superiority of both BSF and AβBSF algorithms in solving FS problems. The source code of this work is available in.
1 September 2021 in Knowledge-Based Systems
1 January 2020 in IEEE Access
Feature Selection (FS) is an important pre-processing step in the fields of machine learning and data mining, which has a major impact on the performance of the corresponding learning models. The main goal of FS is to remove the irrelevant and redundant features, resulting in optimized time and space requirements along with enhanced performance of the learning model under consideration. Many metaheuristic optimization techniques have been applied to solve FS problems because of its superiority over the traditional optimization approaches. Here, we have introduced a new hybrid meta-heuristic FS model based on a well-known meta-heuristic Harmony Search (HS) algorithm and a recently proposed Ring Theory based Evolutionary Algorithm (RTEA), which we have named as Ring Theory based Harmony Search (RTHS). Effectiveness of RTHS has been evaluated by applying it on 18 standard UCI datasets and comparing it with 10 state-of-the-art meta-heuristic FS methods. Obtained results prove the superiority of RTHS over the state-of-the-art methods considered here for comparison.
15 March 2022 in Expert Systems with Applications
27 August 2020 in IEEE Access
KMKrishnendu Mukhopadhyay
+1
Selecting the most relevant features from a high dimensional dataset is always a challenging task. In this regard, the feature selection (FS) method acts as a solution to this problem mainly in the domain of data mining and machine learning. It aims at improving the performance of a learning model greatly by choosing the relevant features and ignoring the redundant ones. Besides, this also helps to achieve efficient use of space and time by the learning model under consideration. Though over the years, many meta-heuristic algorithms have been proposed by the researchers to solve FS problem, still this is considered as the open research problem due to its enormous challenges. Particularly, these algorithms, at times, suffer from poor convergence because of the improper tuning of exploration and exploitation phases. Here lies the importance of the hybrid meta-heuristics which help to improve the searching capability and convergence rate of the parent algorithms. To this end, the present work introduces a new hybrid meta-heuristic FS model by combining two meta-heuristics - Harmony Search (HS) algorithm and Artificial Electric Field Algorithm (AEFA), which we have named as Electrical Harmony based Hybrid Meta-heurtistic (EHHM). The proposed hybrid meta-heuristic converges faster than its predecessors, thereby ensuring its capability to search efficiently. Usability of EHHM is examined by applying it on 18 standard UCI datasets. Moreover, to prove its supremacy, we have compared it with 10 state-of-the-art FS methods. Link to code implementation of proposed method: khalid0007/Metaheuristic-Algorithms/FS_AEFAhHS.
14 September 2020 in IEEE Access
Image contrast enhancement is a very important phase for processing of digital images. The main goal of image contrast enhancement is to improve the visual quality by improving the contrast level of images which were distorted or degraded due to casual acquisition of images. The most popular method to perform this task is Histogram Equalization (HE). However, the exhaustive approach taken during HE is an algorithmically complex task. In this paper, we have considered image contrast enhancement as an optimization problem, where a new meta-heuristic algorithm, called Barnacles Mating Optimizer (BMO) is used to find the optimal solution for this optimization problem. A grey level mapping technique is used here to convert an image to a solution of the optimization problem. The algorithm has been evaluated on five publicly available datasets: Kodak, MIT-Adobe FiveK images, H-DIBCO 2016, and H-DIBCO 2018. It is also applied on some standard images like Boy, Lena, Lifting body and Zebra. The obtained results clearly display the effectiveness of the proposed method. The results obtained on the Kodak images are compared with many state-of-the-art methods present in the literature, and the comparison proves the superiority of the proposed method. To test the applicability of BMO in solving real world problems, we have applied it as a pre-processing step in binarization of H-DIBCO 2016 and H-DIBCO 2018 datasets. The source code of this work is available at https://github.com/ahmed-shameem/Projects.