An efficient binary whale optimisation algorithm with optimum path forest for feature selection
by Ahmed Samy; Khalid M. Hosny; Abdel-Naser H. Zaied
International Journal of Computer Applications in Technology (IJCAT), Vol. 63, No. 1/2, 2020

Abstract: Feature selection is an essential process which aims to find the most representative features for image processing and computer vision applications where utilising selected features reduces required time for classification and increases the classification rate. In this study, a new binary whale optimisation algorithm for feature selection is proposed. This optimisation algorithm is based on whales' behaviour. The Optimum-Path Forest (OPF) technique is used as an objective function. This function is much faster than the other classification techniques. The proposed binary whale optimisation algorithm is evaluated using five datasets of colour images. The proposed algorithm outperformed existing optimisation algorithms such as Particle Swarm Optimisation Algorithm (PSOA), Firefly Algorithm (FFA), Gravitational Search Algorithm (GSA), Binary Harmony Search (BHS), Binary Clonal Flower Pollination Algorithm (BCFA), Binary Cuckoo Search Algorithm (BCSA), and Binary Bat Algorithm (BBA) in terms of classification accuracy, number of selected features and execution times.

Online publication date: Tue, 30-Jun-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com