Jose Manuel Muñoz Contreras
Jose Manuel Muñoz Contreras has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Leonardo Trujillo
Instituto Tecnológico de Tijuana
3 shared publications - Daniel E. Hernandez
Instituto Tecnológico de Tijuana
2 shared publications - Luis Cárdenas Florido
Department of Systems and Computing Tecnológico Nacional de México/IT de Ensenada Ensenada Mexico
2 shared publications - Illya Bakurov
Michigan State University
1 shared publication - Leonardo Vanneschi
Universidade Nova de Lisboa
1 shared publication - Mauro Castelli
NOVA Information Management School (NOVA IMS), Universidade Nova de Lisboa, Campus de Campolide, Lisboa, Portugal
1 shared publication
Latest Publications
- 21 December 2024
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 26 (1) , 1-18
Benchmarking GSGP: Still competitive 10 years later?
- 21 December 2024
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 26 (1) , 1-18
Benchmarking GSGP: Still competitive 10 years later?
- Open Access
- 18 March 2024
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 29 (2) , 25
M5GP: Parallel Multidimensional Genetic Programming with Multidimensional Populations for Symbolic Regression
Machine learning and artificial intelligence are growing in popularity thanks to their ability to produce models that exhibit unprecedented performance in domains that include computer vision, natural language processing and code generation. However, such models tend to be very large and complex and impossible to understand using traditional analysis or human scrutiny. Conversely, Symbolic Regression methods attempt to produce models that are relatively small and (potentially) human-readable. In this domain, Genetic Programming (GP) has proven to be a powerful search strategy that achieves state-of-the-art performance. This paper presents a new GP-based feature transformation method called M5GP, which is hybridized with multiple linear regression to produce linear models, implemented to exploit parallel processing on graphical processing units for efficient computation. M5GP is the most recent variant from a family of feature transformation methods (M2GP, M3GP and M4GP) that have proven to be powerful tools for both classification and regression tasks applied to tabular data. The proposed method was evaluated on SRBench v2.0, the current standard benchmarking suite for Symbolic Regression. Results show that M5GP achieves performance that is competitive with the state-of-the-art, achieving a top-three rank on the most difficult subset of black-box problems. Moreover, it achieves the lowest computation time when compared to other GP-based methods that have similar accuracy scores.
- 18 March 2024
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 29 (2) , 25
Open AccessM5GP: Parallel Multidimensional Genetic Programming with Multidimensional Populations for Symbolic Regression
Machine learning and artificial intelligence are growing in popularity thanks to their ability to produce models that exhibit unprecedented performance in domains that include computer vision, natural language processing and code generation. However, such models tend to be very large and complex and impossible to understand using traditional analysis or human scrutiny. Conversely, Symbolic Regression methods attempt to produce models that are relatively small and (potentially) human-readable. In this domain, Genetic Programming (GP) has proven to be a powerful search strategy that achieves state-of-the-art performance. This paper presents a new GP-based feature transformation method called M5GP, which is hybridized with multiple linear regression to produce linear models, implemented to exploit parallel processing on graphical processing units for efficient computation. M5GP is the most recent variant from a family of feature transformation methods (M2GP, M3GP and M4GP) that have proven to be powerful tools for both classification and regression tasks applied to tabular data. The proposed method was evaluated on SRBench v2.0, the current standard benchmarking suite for Symbolic Regression. Results show that M5GP achieves performance that is competitive with the state-of-the-art, achieving a top-three rank on the most difficult subset of black-box problems. Moreover, it achieves the lowest computation time when compared to other GP-based methods that have similar accuracy scores.
- 8 February 2024
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 25 (1) , 1-29
Geometric semantic genetic programming with normalized and standardized random programs
- 8 February 2024
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 25 (1) , 1-29
Geometric semantic genetic programming with normalized and standardized random programs