S-shaped versus V-shaped transfer functions for binary Manta ray foraging optimization in feature selection problem

被引:81
作者
Ghosh, Kushal Kanti [1 ]
Guha, Ritam [1 ]
Bera, Suman Kumar [1 ]
Kumar, Neeraj [2 ,3 ,4 ,5 ]
Sarkar, Ram [1 ]
机构
[1] Jadavpur Univ, Dept Comp Sci & Engn, Kolkata, India
[2] Thapar Inst Engn & Technol, Dept Comp Sci & Engn, Patiala, Punjab, India
[3] Asia Univ, Dept Comp Sci & Informat Engn, Taichung, Taiwan
[4] Univ Petr & Energy Studies UPES, Sch Comp Sci, Dehra Dun 248007, Uttarakhand, India
[5] King Abdulaziz Univ, Jeddah, Saudi Arabia
关键词
Manta ray foraging optimization; Feature selection; Optimization; Classification; Transfer functions; Metaheuristic; ANOMALY DETECTION; ALGORITHM; HYBRID; COLONY;
D O I
10.1007/s00521-020-05560-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection (FS) is considered as one of the core concepts in the areas of machine learning and data mining which immensely impacts the performance of classification model. Through FS, irrelevant or partially relevant features can be eliminated which in turn helps in enhancing the performance of the model. Over the years, researchers have applied different meta-heuristic optimization techniques for the purpose of FS as these overcome the limitations of traditional optimization approaches. Going by the trend, we introduce a new FS approach based on a recently proposed meta-heuristic algorithm called Manta ray foraging optimization (MRFO) which is developed following the food foraging nature of the Manta rays, one of the largest known marine creatures. As MRFO is apposite for continuous search space problems, we have adapted a binary version of MRFO to fit it into the problem of FS by applying eight different transfer functions belonging to two different families: S-shaped and V-shaped. We have evaluated the eight binary versions of MRFO on 18 standard UCI datasets. Of these, the best one is considered for comparison with 16 recently proposed meta-heuristic FS approaches. The results show that MRFO outperforms the state-of-the-art methods in terms of both classification accuracy and number of features selected. The source code of this work is available in https://github.com/Rangerix/MetaheuristicOptimization.
引用
收藏
页码:11027 / 11041
页数:15
相关论文
共 50 条
[21]   A two-stage approach towards protein secondary structure classification [J].
Ghosh, Kushal Kanti ;
Ghosh, Soulib ;
Sen, Sagnik ;
Sarkar, Ram ;
Maulik, Ujjwal .
MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING, 2020, 58 (08) :1723-1737
[22]   Introducing clustering based population in Binary Gravitational Search Algorithm for Feature Selection [J].
Guha, Ritam ;
Ghosh, Manosij ;
Chakrabarti, Akash ;
Sarkar, Ram ;
Mirjalili, Seyedali .
APPLIED SOFT COMPUTING, 2020, 93
[23]   Embedded chaotic whale survival algorithm for filter-wrapper feature selection [J].
Guha, Ritam ;
Ghosh, Manosij ;
Mutsuddi, Shyok ;
Sarkar, Ram ;
Mirjalili, Seyedali .
SOFT COMPUTING, 2020, 24 (17) :12821-12843
[24]  
Guha R, 2020, 2020 IEEE CALCUTTA CONFERENCE (CALCON), P54, DOI [10.1109/CALCON49167.2020.9106516, 10.1109/calcon49167.2020.9106516]
[25]  
Han J, 2012, MOR KAUF D, P1
[26]  
Helfman G, 2014, SHARKS
[27]  
Karaboga, 2005, IDEA BASED HONEY BEE
[28]   An efficient ant colony optimization approach to attribute reduction in rough set theory [J].
Ke, Liangjun ;
Feng, Zuren ;
Ren, Zhigang .
PATTERN RECOGNITION LETTERS, 2008, 29 (09) :1351-1357
[29]  
Kennedy J., 1995, 1995 IEEE International Conference on Neural Networks Proceedings (Cat. No.95CH35828), P1942, DOI 10.1109/ICNN.1995.488968
[30]   THE FEATURE SELECTION PROBLEM IN COMPUTER-ASSISTED CYTOLOGY [J].
Kowal, Marek ;
Skobel, Marcin ;
Nowicki, Norbert .
INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2018, 28 (04) :759-770