Optimizing the Feature Selection Problem with Pendulum Search Algorithm: Binarization Strategies and Their Impacts
Abstract
Technological advances and the digitization of information have allowed us to obtain a large amount of data from different processes such as medicine, commerce, and mining, among others. All this data has been used as input by different researchers in machine learning techniques to speed up the decision making process of professionals. Machine learning techniques are susceptible to data, so cleaning it to remove irrelevant and redundant information is necessary. This removal of information is known as the Feature Selection Problem. This work presents the Pendulum Search Algorithm (PSA) applied to solve the Feature Selection Problem. As the PSA is a metaheuristic designed for continuous optimization problems, a binarization process is performed using the Two-Step Technique. In particular, we have used four transfer functions and three binarization rules to observe their impact when binarizing PSA. Preliminary results indicate that the V-Shaped transfer function and the Standard binarization rule is the binarization scheme that obtains the best experimental results.
Más información
Título según WOS: | ID WOS:001450703600035 Not found in local WOS DB |
Título de la Revista: | ARTIFICIAL INTELLIGENCE ALGORITHM DESIGN FOR SYSTEMS, VOL 3 |
Volumen: | 1120 |
Editorial: | SPRINGER INTERNATIONAL PUBLISHING AG |
Fecha de publicación: | 2024 |
Página de inicio: | 390 |
Página final: | 402 |
DOI: |
10.1007/978-3-031-70518-2_35 |
Notas: | ISI |