Title: Feature selection and instance selection using cuttlefish optimisation algorithm through tabu search

Authors: V. Karunakaran; M. Suganthi; V. Rajasekar

Addresses: Computer Science and Engineering, Karunya Institute of Technology and Sciences, Coimbatore, India ' Electronics and Communication Engineering, Mahendra College of Engineering, Salem, India ' Computer Science and Engineering, AMC Engineering College, Bangalore, India

Abstract: Over the recent decades, the amount of data generated has been growing exponentially, the existing machine learning algorithms are not feasible for processing of such huge amount of data. To solve such kind of issues, we have two commonly adopted schemes, one is scaling up the data mining algorithms and other one is data reduction. Scaling up the data mining algorithms is not a best way, but data reduction is fairly possible. In this paper, cuttlefish optimisation algorithm along with tabu search approach is used for data reduction. Dataset can be reduced mainly in two ways, one is the selecting optimal subset of features from the original dataset, in other words eliminating those features which are contributing lesser information another method is selecting optimal subset of instances from the original data set, in other words eliminating those instances which are contributing lesser information. Cuttlefish optimisation algorithm with tabu search finds both optimal subset of features and instances. Optimal subset of feature and instance obtained from the cuttlefish algorithm with tabu search provides a similar detection rate, accuracy rate, lesser false positive rate and the lesser computational time for training the classifier that we obtained from the original data set.

Keywords: data reduction; instance selection; feature selection; cuttlefish optimisation; tabu search.

DOI: 10.1504/IJENM.2020.10025348

International Journal of Enterprise Network Management, 2020 Vol.11 No.1, pp.32 - 64

Received: 04 Jul 2018
Accepted: 24 Feb 2019

Published online: 15 Nov 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article