Binary Social Mimic Optimization Algorithm With X-Shaped Transfer Function for Feature Selection
Definitive optimization algorithms are not able to solve high dimensional optimization problems when the search space grows exponentially with the problem size, and an exhaustive search also becomes impractical. To encounter this problem, researchers use approximation algorithms. A category of appro...
Main Authors: | Kushal Kanti Ghosh, Pawan Kumar Singh, Junhee Hong, Zong Woo Geem, Ram Sarkar |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9098869/ |
Similar Items
-
Late Acceptance Hill Climbing Based Social Ski Driver Algorithm for Feature Selection
by: Bitanu Chatterjee, et al.
Published: (2020-01-01) -
Hybrid of Harmony Search Algorithm and Ring Theory-Based Evolutionary Algorithm for Feature Selection
by: Shameem Ahmed, et al.
Published: (2020-01-01) -
COVID-19 Detection by Optimizing Deep Residual Features with Improved Clustering-Based Golden Ratio Optimizer
by: Soham Chattopadhyay, et al.
Published: (2021-02-01) -
Improved Binary Sailfish Optimizer Based on Adaptive <italic>β</italic>-Hill Climbing for Feature Selection
by: Kushal Kanti Ghosh, et al.
Published: (2020-01-01) -
Mayfly in Harmony: A New Hybrid Meta-Heuristic Feature Selection Algorithm
by: Trinav Bhattacharyya, et al.
Published: (2020-01-01)