Binary Multi-Verse Optimization (BMVO) Approaches for Feature Selection

TitleBinary Multi-Verse Optimization (BMVO) Approaches for Feature Selection
Publication TypeJournal Article
Year of PublicationIn Press
AuthorsHans, R., and H. Kaur
JournalInternational Journal of Interactive Multimedia and Artificial Intelligence
ISSN1989-1660
IssueIn Press
VolumeIn Press
NumberIn Press
Date Published07/2019
Pagination1-16
Abstract

Multi-Verse Optimization (MVO) is one of the newest meta-heuristic optimization algorithms which imitates the theory of Multi-Verse in Physics and resembles the interaction among the various universes. In problem domains like feature selection, the solutions are often constrained to the binary values viz. 0 and 1. With regard to this, in this paper, binary versions of MVO algorithm have been proposed with two prime aims: firstly, to remove redundant and irrelevant features from the dataset and secondly, to achieve better classification accuracy. The proposed binary versions use the concept of transformation functions for the mapping of a continuous version of the MVO algorithm to its binary versions. For carrying out the experiments, 21 diverse datasets have been used to compare the Binary MVO (BMVO) with some binary versions of existing metaheuristic algorithms. It has been observed that the proposed BMVO approaches have outperformed in terms of a number of features selected and the accuracy of the classification process.

KeywordsBinary Multi-Verse Optimization, Feature Selection, K-Nearest Neighbors, Machine Learning
DOI10.9781/ijimai.2019.07.004
URLhttps://www.ijimai.org/journal/sites/default/files/files/2019/07/ip2019_07_04_pdf_15866.pdf
AttachmentSize
ip2019_07_04.pdf2.06 MB