Abstract

Feature selection (FS) is considered as one of the core concepts in the areas of machine learning and data mining which immensely impacts the performance of classification model. Through FS, irrelevant or partially relevant features can be eliminated which in turn helps in enhancing the performance of the model. Over the years, researchers have applied different meta-heuristic optimization techniques for the purpose of FS as these overcome the limitations of traditional optimization approaches. Going by the trend, we introduce a new FS approach based on a recently proposed meta-heuristic algorithm called Manta ray foraging optimization (MRFO) which is developed following the food foraging nature of the Manta rays, one of the largest known marine creatures. As MRFO is apposite for continuous search space problems, we have adapted a binary version of MRFO to fit it into the problem of FS by applying eight different transfer functions belonging to two different families: S-shaped and V-shaped. We have evaluated the eight binary versions of MRFO on 18 standard UCI datasets. Of these, the best one is considered for comparison with 16 recently proposed meta-heuristic FS approaches. The results show that MRFO outperforms the state-of-the-art methods in terms of both classification accuracy and number of features selected. The source code of this work is available in https://github.com/Rangerix/MetaheuristicOptimization .

Highlights

  • In recent times, due to the huge amount of data collected every minute and the need to convert such data into useful information, data mining is considered one of the fastest growing fields of Information Technology [1]

  • We have proposed the binary version of Manta Ray Foraging Optimization (MRFO) for selection of optimal subset of features

  • Since MRFO is reported to be suitable for continuous search space problems, we have modified MRFO for the binary search space to fit it into the problem of feature selection (FS) using eight different transfer functions which belong to two different families: S-shaped and V-shaped

Read more

Summary

Introduction

Due to the huge amount of data collected every minute and the need to convert such data into useful information, data mining is considered one of the fastest growing fields of Information Technology [1]. The first proposed FS technique using meta-heuristic approach is Genetic Algorithm (GA) [6]. Ant Colony Optimization (ACO) [12] is another meta-heuristic algorithm that mimics the behaviour of real ants when searching for the shortest path to a food source. In [21], authors have proposed binary version of Grasshopper Optimization Algorithm (BGOA) using S-Shaped and V-Shaped functions. This, in turn, implies that currently proposed algorithms for FS are not able to solve all FS problems This motivated us to propose a new FS approach based on a recently proposed meta-heuristic algorithm, Manta Ray Foraging Optimization (MRFO) [24]. The methods are evaluated on 18 standard datasets and compared with different recently proposed meta-heuristic FS techniques to validate the performance of the same

Manta Ray Foraging Optimization: A Brief Overview
Manta Ray Representation
Fitness Function
Datasets
Parameter Tuning
Conclusion and Future Work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call