Time-varying hierarchical chains of salps with random weight networks for feature selection

No Thumbnail Available
File version
Author(s)
Faris, H
Heidari, AA
Al-Zoubi, AM
Mafarja, M
Aljarah, I
Eshtay, M
Mirjalili, S
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2020
Size
File type(s)
Location
License
Abstract

Feature selection (FS) is considered as one of the most common and challenging tasks in Machine Learning. FS can be considered as an optimization problem that requires an efficient optimization algorithm to find its optimal set of features. This paper proposes a wrapper FS method that combines a time-varying number of leaders and followers binary Salp Swarm Algorithm (called TVBSSA) with Random Weight Network (RWN). In this approach, the TVBSSA is used as a search strategy, while RWN is utilized as an induction algorithm. The objective function is formulated in a manner to aggregate three objectives: maximizing the classification accuracy, maximizing the reduction rate of the selected features, and minimizing the complexity of generated RWN models. To assess the performance of the proposed approach, 20 well-known UCI datasets and a number of existing FS methods are employed. The comparative results show the ability of the proposed approach in outperforming similar algorithms in the literature and its merits to be used in systems that require FS.

Journal Title

Expert Systems with Applications

Conference Title
Book Title
Edition
Volume

140

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Mathematical sciences

Engineering

Persistent link to this record
Citation

Faris, H; Heidari, AA; Al-Zoubi, AM; Mafarja, M; Aljarah, I; Eshtay, M; Mirjalili, S, Time-varying hierarchical chains of salps with random weight networks for feature selection, Expert Systems with Applications, 2020, 140, pp. 112898: 1-112898: 17

Collections