Chaotic Binary Pelican Optimization Algorithm for Feature Selection
Rama Krishna Eluri, Nagaraju Devarakonda
Abstract
This research proposes a new wrapper model based on chaos theory and nature-inspired pelican optimization algorithm (POA) for feature selection. The base algorithm is converted into a binary one and a chaotic search to augment POA’s exploration and exploitation process, denoted as chaotic binary pelican optimization algorithm (CBPOA). The main focus of chaos theory is to resolve the slow convergence rate as well as entrapment in local optimal issues of classical POA. Therefore, ten dissimilar chaotic maps are entrenched in POA to tackle these issues and attain a more robust and effective search mechanism. CBPOA executes on continuous search; thus, the continuous search is reformed to a discrete one by adapting transfer functions. In CBPOA, eight transfer functions are used to find the best one and inspect CBPOA. Consequently, the performance of the CBPOA has been investigated by targeting several metrics under 18 UCI datasets. The best variant is nominated and explored the performance with classical wrapper-based and filter-based schemes. Furthermore, the proposed CBPOA is evaluated using 23 functions from CEC-2017, 2018 and 2020 benchmarks. As an outcome, CBPOA has accomplished better outcomes than existing schemes and is superior in handling feature selection problems.