Felipe Cisternas-Caneo

Mr. Felipe Cisternas-Caneo

Pontificia Universidad Católica de Valparaíso
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 December 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
JBJosé Carlos Barrera-García
José Carlos Barrera-García
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
Broderick CrawfordBroderick Crawford
Broderick Crawford
MSMariam Gómez Sánchez
Mariam Gómez Sánchez
Ricardo SotoRicardo Soto
Ricardo Soto
Feature selection is becoming a relevant problem within the field of machine learning. The feature selection problem focuses on the selection of the small, necessary, and sufficient subset of features that represent the general set of features, eliminating redundant and irrelevant information. Given the importance of the topic, in recent years there has been a boom in the study of the problem, generating a large number of related investigations. Given this, this work analyzes 161 articles published between 2019 and 2023 (20 April 2023), emphasizing the formulation of the problem and performance measures, and proposing classifications for the objective functions and evaluation metrics. Furthermore, an in-depth description and analysis of metaheuristics, benchmark datasets, and practical real-world applications are presented. Finally, in light of recent advances, this review paper provides future research opportunities.

27 December 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
MRMarcelo Orlando Becerra Rozas
Marcelo Orlando Becerra Rozas
JLJOSE LEMUS-ROMANI
JOSE LEMUS-ROMANI
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
Broderick CrawfordBroderick Crawford
Broderick Crawford
Ricardo SotoRicardo Soto
Ricardo Soto
JGJose Garcia
Jose Garcia
For years, extensive research has been in the binarization of continuous metaheuristics for solving binary-domain combinatorial problems. This paper is a continuation of a previous review and seeks to draw a comprehensive picture of the various ways to binarize this type of metaheuristics; the study uses a standard systematic review consisting of the analysis of 512 publications from 2017 to January 2022 (5 years). The work will provide a theoretical foundation for novice researchers tackling combinatorial optimization using metaheuristic algorithms and for expert researchers analyzing the binarization mechanism’s impact on the metaheuristic algorithms’ performance. Structuring this information allows for improving the results of metaheuristics and broadening the spectrum of binary problems to be solved. We can conclude from this study that there is no single general technique capable of efficient binarization; instead, there are multiple forms with different performances.

4 August 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Broderick CrawfordBroderick Crawford
Broderick Crawford
Ricardo SotoRicardo Soto
Ricardo Soto
JLJOSE LEMUS-ROMANI
JOSE LEMUS-ROMANI
MRMarcelo Orlando Becerra Rozas
Marcelo Orlando Becerra Rozas
JLJose M. Lanza-Gutierrez
Jose M. Lanza-Gutierrez
JRJosé-Miguel Rubio
José-Miguel Rubio
One of the central issues that must be resolved for a metaheuristic optimization process to work well is the dilemma of the balance between exploration and exploitation. The metaheuristics (MH) that achieved this balance can be called balanced MH, where a Q-Learning (QL) integration framework was proposed for the selection of metaheuristic operators conducive to this balance, particularly the selection of binarization schemes when a continuous metaheuristic solves binary combinatorial problems. In this work the use of this framework is extended to other recent metaheuristics, demonstrating that the integration of QL in the selection of operators improves the exploration-exploitation balance. Specifically, the Whale Optimization Algorithm and the Sine-Cosine Algorithm are tested by solving the Set Covering Problem, showing statistical improvements in this balance and in the quality of the solutions.

12 November 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
JLJOSE LEMUS-ROMANI
JOSE LEMUS-ROMANI
MRMarcelo Orlando Becerra Rozas
Marcelo Orlando Becerra Rozas
Broderick CrawfordBroderick Crawford
Broderick Crawford
Ricardo SotoRicardo Soto
Ricardo Soto
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
JGJose Garcia
Jose Garcia
Currently, industry is undergoing an exponential increase in binary-based combinatorial problems. In this regard, metaheuristics have been a common trend in the field in order to design approaches to successfully solve them. Thus, a well-known strategy includes the employment of continuous swarm-based algorithms transformed to perform in binary environments. In this work, we propose a hybrid approach that contains discrete smartly adapted population-based strategies to efficiently tackle binary-based problems. The proposed approach employs a reinforcement learning technique, known as SARSA (State–Action–Reward–State–Action), in order to utilize knowledge based on the run time. In order to test the viability and competitiveness of our proposal, we compare discrete state-of-the-art algorithms smartly assisted by SARSA. Finally, we illustrate interesting results where the proposed hybrid outperforms other approaches, thus, providing a novel option to tackle these types of problems in industry.

1 September 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
JLJOSE LEMUS-ROMANI
JOSE LEMUS-ROMANI
Broderick CrawfordBroderick Crawford
Broderick Crawford
FCFelipe Cisternas-Caneo
Felipe Cisternas-Caneo
Ricardo SotoRicardo Soto
Ricardo Soto
MRMarcelo Orlando Becerra Rozas
Marcelo Orlando Becerra Rozas
In this work, an approach is proposed to solve binary combinatorial problems using continuous metaheuristics. It focuses on the importance of binarization in the optimization process, as it can have a significant impact on the performance of the algorithm. Different binarization schemes are presented and a set of actions, which combine different transfer functions and binarization rules, under a selector based on reinforcement learning is proposed. The experimental results show that the binarization rules have a greater impact than transfer functions on the performance of the algorithms and that some sets of actions are statistically better than others. In particular, it was found that sets that incorporate the elite or elite roulette binarization rule are the best. Furthermore, exploration and exploitation were analyzed through percentage graphs and a statistical test was performed to determine the best set of actions. Overall, this work provides a practical approach for the selection of binarization schemes in binary combinatorial problems and offers guidance for future research in this field.

22 March 2021
Verified
Conference Paper
Closed access
DTDiego Tapia
Diego Tapia
BCBroderick Crawford
Broderick Crawford
RSRicardo Soto
Ricardo Soto
WPWenceslao Palma
Wenceslao Palma
JLJose Lemus-Romani
Jose Lemus-Romani
SMSanjay Misra
Sanjay Misra
In the different situations present in the industry, combinatorial problems are increasingly frequent. This paper presents the interaction of Metaheuristics and Machine Learning, specifically as Machine Learning can be a support to enhance Metaheuristics. The resolution of the Set Covering Problem is presented, using the Grey Wolf Optimizer and Sine Cosine Algorithm metaheuristics that have been improved by adding a Q-Learning technique for the selection of a Discretization Scheme, using two-steps, intelligently choosing which transfer function to use and which binarization technique to apply in each iteration. The results show a better result for the Grey Wolf Optimizer with Q-Learning configuration, compared to other configurations in the literature, obtaining a better balance between exploration and exploitation.