B-PSA: A Binary Pendulum Search Algorithm for the Feature Selection Problem
No hay miniatura disponible
Archivos
Fecha
2023-12-12
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Multidisciplinary Digital Publishing Institute (MDPI)
Nombre de Curso
Licencia CC
CC BY 4.0 DEED
Attribution 4.0 International
Licencia CC
https://creativecommons.org/licenses/by/4.0/
Resumen
The digitization of information and technological advancements have enabled us to gather vast amounts of data from various domains, including but not limited to medicine, commerce, and mining. Machine learning techniques use this information to improve decision-making, but they have a big problem: they are very sensitive to data variation, so it is necessary to clean them to remove irrelevant and redundant information. This removal of information is known as the Feature Selection Problem. This work presents the Pendulum Search Algorithm applied to solve the Feature Selection Problem. As the Pendulum Search Algorithm is a metaheuristic designed for continuous optimization problems, a binarization process is performed using the Two-Step Technique. Preliminary results indicate that our proposal obtains competitive results when compared to other metaheuristics extracted from the literature, solving well-known benchmarks.
Notas
Indexación: Scopus.
Palabras clave
binarization schemes, combinatorial optimization, Feature Selection Problem, Pendulum Search Algorithm
Citación
Computers Open Access Volume 12, Issue 12 December 2023 Article number 249
DOI
10.3390/computers12120249