Feature selection using Binary Crow Search Algorithm with time varying flight length

•Feature selection approach based on Binary Crow Search Algorithm is proposed.•Time varying flight length is used to enhance balance between exploration & exploitation.•8 variants of the proposed method based on different transfer functions are tested.•Performance of proposed method is evaluated...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications Jg. 168; S. 114288
Hauptverfasser: Chaudhuri, Abhilasha, Sahu, Tirath Prasad
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 15.04.2021
Elsevier BV
Schlagworte:
Algorithms
Classification
Crow Search Algorithm
Exploitation
Feature selection
Heuristic methods
High dimensional data
Parameters
Search algorithms
Transfer function
Transfer functions
Crow Search Algorithm
Feature selection
High dimensional data
Transfer function
Classification
ISSN:0957-4174, 1873-6793
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Feature selection approach based on Binary Crow Search Algorithm is proposed.•Time varying flight length is used to enhance balance between exploration & exploitation.•8 variants of the proposed method based on different transfer functions are tested.•Performance of proposed method is evaluated on 20 benchmark datasets.•Proposed approach outperformed other feature selection approaches. Crow Search Algorithm (CSA) is a simple yet effective meta-heuristic algorithm that has been applied to solve many engineering problems. In CSA, fl parameter controls the search capability of crows and AP parameter balances the trade-off between exploration and exploitation. The parameter fl is initialized to a constant value in CSA. However, CSA faces the problem of being trapped in local minima. This work proposes the solution to this problem by introducing the new concept of time varying flight length in CSA. The value of fl should be large in initial stages of algorithm in order to support random exploration and it should gradually decrease in later iterations to encourage the exploitation of good solutions found so far. The proposed approach, Binary Crow Search Algorithm with Time Varying Flight Length (BCSA-TVFL) is applied to feature selection problems in wrapper mode. Eight variants of BCSA-TVFL based on eight different transfer functions are tested. The best performing variant is then selected and compared with other state-of-the-art wrapper feature selection techniques and standard filter feature selection techniques. Performance of proposed approach is tested on 20 standard UCI datasets. Experimental result comparison shows that the proposed feature selection technique performs better than other competitors.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2020.114288