Binary Whale Optimization Algorithm with Logarithmic Decreasing Time-Varying Modified Sigmoid Transfer Function for Descriptor Selection Problem

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In cheminformatics, choosing the right descriptors is a crucial step in improving predictive models, particularly those that use machine learning algorithms. Recently, researchers in cheminformatics have been lured to swarm intelligence to optimize the process of discovering relevant descriptors in the wrapper feature selection. This work introduced a new Binary Whale Optimization Algorithm, which utilized a novel time-varying modified Sigmoid transfer function with a modified logarithmic decreasing time-varying update strategy to improve the balancing of exploration and exploitation in WOA. The new Binary Whale Optimization Algorithm is integrated with wrapper feature selection and validated on descriptor selection problem to improve Amphetamine-type stimulants drug classification result. The suggested approach is compared to well-known swarm intelligence algorithms, and the results demonstrate its superiority.

Cite

CITATION STYLE

APA

Yusof, N. M., Muda, A. K., Pratama, S. F., Carbo-Dorca, R., & Abraham, A. (2023). Binary Whale Optimization Algorithm with Logarithmic Decreasing Time-Varying Modified Sigmoid Transfer Function for Descriptor Selection Problem. In Lecture Notes in Networks and Systems (Vol. 648 LNNS, pp. 673–681). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-27524-1_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free