Abstract

Feature selection is a process to reduce the dimension of a dataset by removing redundant features, and to use the optimal subset of features for machine learning or data mining algorithms. This helps to minimize the time requirement to train a learning algorithm as well as to lessen the storage requirement by ignoring the less-informative features. Feature selection can be considered as a combinatorial optimization problem. In this paper, the authors have presented a new feature selection algorithm called Mayfly-Harmony Search (MA-HS) based on two meta-heuristics namely Mayfly Algorithm and Harmony Search. Mayfly Algorithm has not hitherto been used for feature selection problems to the best of the author's knowledge. An S-shaped transfer function is incorporated for converting it into a binary version of Mayfly Algorithm. When different candidate solutions obtained from various regions of the search space using Mayfly Algorithm are taken into the harmony memory and processed by Harmony Search, a superior solution can be ensured. This is the primary reason for proposing a hybrid of Mayfly Algorithm and Harmony Search. Thus, combining harmony search with Mayfly Algorithm leads to an increased exploitation of the search space and an overall improvement in the performance of Mayfly-Harmony Search (MA-HS) algorithm. The proposed algorithm has been applied on 18 UCI datasets and compared with 12 other state-of-the-art meta-heuristic FS methods. Experiments have also been performed on three high-dimensional microarray datasets. The results obtained support the superior performance of the algorithm compared to the other methods. The source code of the proposed algorithm can be found using the link as follows: https://github.com/trin07/MA-HS.

Highlights

  • In recent years, with the improvement in data collection methods in various fields, the amount of data available has increased dramatically

  • EXPERIMENTAL RESULTS This section deals with the results which support the effectiveness of the Mayfly-Harmony Search (MA-Harmony Search (HS)) algorithm for solving the feature selection (FS) problem

  • The authors have set K = 5 as per recommendations reported by Mafarja et al [74]

Read more

Summary

INTRODUCTION

With the improvement in data collection methods in various fields, the amount of data available has increased dramatically. Bhattacharyya et al.: Mayfly in Harmony: A New Hybrid Meta-heuristic Feature Selection Algorithm ones so no classifier is required to gauge the effectiveness of the filter methods. MA is a recently proposed meta-heuristic which has been shown to perform well in dealing with optimization problems. In real-world optimization problems, it is not feasible to perform an exhaustive search due to the large amount of time required for processing This is where heuristic methods are useful. Numerous meta-heuristic algorithms have been proposed in recent years to solve optimization problems in various domains. Most of these methods have been used to solve the FS problem in the literature. This is a difficult task, especially the wrapper-based methods

PROPOSED MA-HS ALGORITHM
FITNESS FUNCTION
EXPERIMENTAL RESULTS
COMPARISON AND DISCUSSION
STATISTICAL SIGNIFICANCE TEST
VIII. CONCLUSION AND FUTURE DIRECTION
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