Jairo Rojas-Delgado
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jairo Rojas-Delgado has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Rafael Trujillo-Rasúa
Universidad de las Ciencias Informáticas
3 shared publications - Jose Antonio Lozano
Basque Center for Applied Mathematics (BCAM)
2 shared publications Rafael Bello
Universidad Central de Las Villas
2 shared publications- Rafael Bello
Universidad Central “Marta Abreu” de Las Villas
2 shared publications Borja Calvo
Intelligent Systems Group, University of the Basque Country (UPV/EHU), Donostia-San Sebastian, Spain
1 shared publication- Gerdys Ernesto Jiménez Moya
Vice-Rectorate for Research and Postgraduate Studies, University of Informatics Sciences, Havana 19370, Cuba
1 shared publication
Latest Publications
- Open Access
- 31 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (1) , 44-68
A revisited branch-and-cut algorithm for large-scale orienteering problems
- 31 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (1) , 44-68
Open AccessA revisited branch-and-cut algorithm for large-scale orienteering problems
- 23 February 2023
- Published by Springer Nature
- p. 365-377
Hyper-parameter Optimization Using Continuation Algorithms
- 23 February 2023
- Published by Springer Nature
- p. 365-377
Hyper-parameter Optimization Using Continuation Algorithms
- 20 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 26 (6) , 1281-1292
Bayesian Performance Analysis for Algorithm Ranking Comparison
In the field of optimization and machine learning, the statistical assessment of results has played a key role in conducting algorithmic performance comparisons. Classically, null hypothesis statistical tests have been used. However, recently, alternatives based on Bayesian statistics have shown great potential in complex scenarios, especially when quantifying the uncertainty in the comparison. In this work, we delve deep into the Bayesian statistical assessment of experimental results by proposing a framework for the analysis of several algorithms on several problems/instances. To this end, experimental results are transformed to their corresponding rankings of algorithms, assuming that these rankings have been generated by a probability distribution (defined on permutation spaces). From the set of rankings, we estimate the posterior distribution of the parameters of the studied probability models, and several inferences concerning the analysis of the results are examined. Particularly, we study questions related to the probability of having one algorithm in the first position of the ranking or the probability that two algorithms are in the same relative position in the ranking. Not limited to that, the assumptions, strengths, and weaknesses of the models in each case are studied. To help other researchers to make use of this kind of analysis, we provide a Python package and source code implementation at.
- 20 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 26 (6) , 1281-1292
Bayesian Performance Analysis for Algorithm Ranking Comparison
In the field of optimization and machine learning, the statistical assessment of results has played a key role in conducting algorithmic performance comparisons. Classically, null hypothesis statistical tests have been used. However, recently, alternatives based on Bayesian statistics have shown great potential in complex scenarios, especially when quantifying the uncertainty in the comparison. In this work, we delve deep into the Bayesian statistical assessment of experimental results by proposing a framework for the analysis of several algorithms on several problems/instances. To this end, experimental results are transformed to their corresponding rankings of algorithms, assuming that these rankings have been generated by a probability distribution (defined on permutation spaces). From the set of rankings, we estimate the posterior distribution of the parameters of the studied probability models, and several inferences concerning the analysis of the results are examined. Particularly, we study questions related to the probability of having one algorithm in the first position of the ranking or the probability that two algorithms are in the same relative position in the ranking. Not limited to that, the assumptions, strengths, and weaknesses of the models in each case are studied. To help other researchers to make use of this kind of analysis, we provide a Python package and source code implementation at.
- 3 May 2021
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 25 (2) , 287-305
A Computational Approach to Finding SEIR Model Parameters that best Explain Infected and Recovered Time Series for SARS-CoV 2
A Computational Approach to Finding SEIR Model Parameters that best Explain Infected and Recovered Time Series for SARS-CoV 2
- 3 May 2021
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 25 (2) , 287-305
A Computational Approach to Finding SEIR Model Parameters that best Explain Infected and Recovered Time Series for SARS-CoV 2
A Computational Approach to Finding SEIR Model Parameters that best Explain Infected and Recovered Time Series for SARS-CoV 2
- 22 October 2019
- Published by Springer Nature
- p. 458-468
Continuous Hyper-parameter Configuration for Particle Swarm Optimization via Auto-tuning
- 22 October 2019
- Published by Springer Nature
- p. 458-468
Continuous Hyper-parameter Configuration for Particle Swarm Optimization via Auto-tuning
- 22 October 2019
- Published by Springer Nature
- p. 769-779
Video Popularity Forecasting to Improve Cache Miss Rate in Content Delivery Networks
- 22 October 2019
- Published by Springer Nature
- p. 769-779
Video Popularity Forecasting to Improve Cache Miss Rate in Content Delivery Networks
- 23 May 2019
- Published by Elsevier in Pattern Recognition Letters
- Vol. 125, 373-380
A continuation approach for training Artificial Neural Networks with meta-heuristics
- 23 May 2019
- Published by Elsevier in Pattern Recognition Letters
- Vol. 125, 373-380
A continuation approach for training Artificial Neural Networks with meta-heuristics
- 22 September 2018
- Published by Springer Nature
- p. 59-67
Training Neural Networks by Continuation Particle Swarm Optimization
- 22 September 2018
- Published by Springer Nature
- p. 59-67
Training Neural Networks by Continuation Particle Swarm Optimization