Abstract

Nature is a great source of inspiration for solving complex problems in real-world. In this paper, a hybrid nature-inspired algorithm is proposed for feature selection problem. Traditionally, the real-world datasets contain all kinds of features informative as well as non-informative. These features not only increase computational complexity of the underlying algorithm but also deteriorate its performance. Hence, there an urgent need of feature selection method that select an informative subset of features from high dimensional without compromising the performance of the underlying algorithm. In this paper, we select an informative subset of features and perform cluster analysis by employing a cross breed approach of binary particle swarm optimization (BPSO) and sine cosine algorithm (SCA) named as hybrid binary particle swarm optimization and sine cosine algorithm (HBPSOSCA). Here, we employ a V-shaped transfer function to compute the likelihood of changing position for all particles. First, the effectiveness of the proposed method is tested on ten benchmark test functions. Second, the HBPSOSCA is used for data clustering problem on seven real-life datasets taken from the UCI machine learning store and gene expression model selector. The performance of proposed method is tested in comparison to original BPSO, modified BPSO with chaotic inertia weight (C-BPSO), binary moth flame optimization algorithm, binary dragonfly algorithm, binary whale optimization algorithm, SCA, and binary artificial bee colony algorithm. The conducted analysis demonstrates that the proposed method HBPSOSCA attain better performance in comparison to the competitive methods in most of the cases.

Highlights

  • The high dimensionality of the feature space is a major concern in today’s day

  • The performance of proposed method is tested in comparison to original binary particle swarm optimization (BPSO), modified BPSO with chaotic inertia weight (C-BPSO), binary moth flame optimization algorithm, binary dragonfly algorithm, binary whale optimization algorithm, sine cosine algorithm (SCA), and binary artificial bee colony algorithm

  • We explore capability of Nature inspired algorithms (NIA) for feature selection problem by introducing a hybrid NIA with the combination of BPSO and SCA named as HBPSOSCA

Read more

Summary

Introduction

The high dimensionality of the feature space is a major concern in today’s day. Usually, there are so many irrelevant and redundant features in the datasets. Researchers have explored NIA such as genetic algorithm (GA) (Yang and Honavar 1998), particle swarm optimization (PSO) (Xue et al 2013; Yang 2014), ant colony optimization (ACO) (Yang 2014; Blum 2005; Ali et al 2017; Ahmed 2005), simulated annealing (SA) (Yang 2014), differential evolution (DE) (Yang 2014; Ali et al 2017), and bacterial foraging optimization (BFO) (Chen et al 2017) for feature selection problem As they consider interaction of the learning algorithm for feature selection, they come under the wrapper method.

Algorithms background
Proposed method
Initialization of swarm
Clustering algorithm
Proposed algorithm
Benchmark functions
Datasets and parameters setup
Parameter setting
F10 Mean SD
Dunn Index and Davies–Bouldin Index
Simulation results on benchmark functions
Simulation results on real-life datasets
Conclusions and future directions
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