arrow
Return

Opposition-based binary competitive optimization algorithm using time-varying V-shape transfer function for feature selection

delete2021-08-02
delete0
PRE
AI
Y
Yousef Sharafi
M
Mohammad Teshnehlab *
DOI:10.1007/s00521-021-06340-9delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
The feature selection problem is known as one of the most critical issues with several applications in classification. Certain features of a dataset do not usually contain useful information or play important roles in the data classification. It is possible to reduce the computational burden through the elimination of unnecessary features. This paper was conducted to propose an opposition-based binary competitive optimization algorithm, namely OBCOOA, to solve the wrapper-based feature selection problems. The basic idea of the competitive optimization algorithm (COOA) lies on the natural competition between different species to survive, which is a continuous algorithm inherently. The present study entailed the main contributions as follows: primarily, a time-varying V-shape transfer function was used in the optimization process to present the binary version of the COOA algorithm, which established the right balance between the exploration and exploitation phases; secondly, in the proposed algorithm, the opposition-based learning mechanism was utilized to improve the diversity quality within the population members and to incorporate a suitable initial population. In the feature selection problem, the classification error rate and the number of selected features objective functions are usually adopted, which causes this problem to convert into a multi-objective optimization one. This research presented a single- and multi-objective approach from the proposed algorithm in order to solve the feature selection problem. The proposed algorithm was applied to 27 benchmark datasets, and the evaluation results were compared to the other well-known binary optimization algorithms. The experimental results indicated that the proposed algorithm has a better ability to find an optimal subset of features with the least classification error rate and the number of the selected features.
Keywords:
Feature selection
Binary optimization
Competitive optimization algorithm
Opposition-based learning
Multi-objective optimization
Classification

Journal

Neural Computing and Applications cover
Neural Computing and Applications
IF:
4.5
Papers:
2.4K
Citations:
3.4W

Organization

No organization information available
Cited Papers

Cited Papers

Binary differential evolution with self-learning for multi-objective feature selection
err2020-01-01
err0
PREAI
errYong Zhang; Dun-wei Gong; Xiao-zhi Gao; Tian Tian; Xiao-yan Sun
errShare
errSave
No free lunch theorems for optimization
err1997-01-01
err0
PREAI
errDavid H. Wolpert; William G. Macready
errShare
errSave
Binary dragonfly optimization for feature selection using time-varying transfer functions
err2018-12-01
err302
errOAAI
errMafarja, Majdi; Aljarah, Ibrahim; Heidari, Ali Asghar; Faris, Hossam; Fournier-Viger, Philippe; Li, Xiaodong; Mirjalili, Seyedali
errShare
errSave
Opposition versus randomness in binary spaces
err2015-02-01
err15
PREAI
errSeif, Z.; Ahmadi, M. B.
errShare
errSave
Artificial bee colony algorithm with multiple search strategies
err2015-11-01
err62
PREAI
errGao, Wei-feng; Huang, Ling-ling; Liu, San-yang; Chan, Felix T. S.; Dai, Cai; Shan, Xian
errShare
errSave
Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection
err2020-05-01
err283
PREAI
errTubishat, Mohammad; Idris, Norisma; Shuib, Liyana; Abushariah, Mohammad A. M.; Mirjalili, Seyedali
errShare
errSave
errShare
errSave
researcher View more