Jacobo Leonardo González-Ruíz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jacobo Leonardo González-Ruíz has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jose Raymundo Marcial Romero
Universidad Autónoma del Estado de México
4 shared publications - Jose Antonio Hernández Servín
Universidad Autónoma del Estado de México
3 shared publications - Angélica Guzmán-Ponce
Universidad Católica de Murcia (UCAM)
1 shared publication - Guillermo De Ita Luna
Faculty of Computer Sciences, Benemérita Universidad Autónoma de Puebla (BUAP), Puebla 72570, Mexico
1 shared publication - Iván Francisco-Valencia
Universidad Autónoma del Estado de México
1 shared publication - Marco A. López-Medina
Universidad Autónoma del Estado de México
1 shared publication
Latest Publications
- Open Access
- 18 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 22 (7) , 539-547
Exploring COVID-19 Trends in Mexico during the Winter Season with Explainable Artificial Intelligence (XAI)
COVID-19 has become the most significant pandemic in recent years. Today, Mexico has recorded millions of infections and deaths since the pandemic started. Around the world, machine learning methods have been used to understand, predict or develop strategies to manage the virus and the pandemic. Although algorithms provide good results, it is necessary to understand why a model makes specific predictions with a particular data set. To explain this question, we apply Explainable Artificial Intelligence (XAI) in this paper. With this, it is possible to understand the characteristics that influence the model decisions when denoting between deaths and survivors. As a case of study, the positive cases detected during the winter season of 2020-2021 and 2021-2022 were considered. In this season, respiratory diseases increased considerably, and in the study period, they influenced the increase in positive cases and the spread of COVID-19. Preliminary results suggest that age is essential when using a Random Forest model. Preliminary results suggest that age is essential when determining the prognosis of a patient infected by COVID-19 in winter seasons.
- 18 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 22 (7) , 539-547
Open AccessExploring COVID-19 Trends in Mexico during the Winter Season with Explainable Artificial Intelligence (XAI)
COVID-19 has become the most significant pandemic in recent years. Today, Mexico has recorded millions of infections and deaths since the pandemic started. Around the world, machine learning methods have been used to understand, predict or develop strategies to manage the virus and the pandemic. Although algorithms provide good results, it is necessary to understand why a model makes specific predictions with a particular data set. To explain this question, we apply Explainable Artificial Intelligence (XAI) in this paper. With this, it is possible to understand the characteristics that influence the model decisions when denoting between deaths and survivors. As a case of study, the positive cases detected during the winter season of 2020-2021 and 2021-2022 were considered. In this season, respiratory diseases increased considerably, and in the study period, they influenced the increase in positive cases and the spread of COVID-19. Preliminary results suggest that age is essential when using a Random Forest model. Preliminary results suggest that age is essential when determining the prognosis of a patient infected by COVID-19 in winter seasons.
- Open Access
- 10 December 2023
- Published by Dirección de Bienes Públicos del Conocimiento, Universidad Autonoma del Estado de Mexico in Informaticae Abstracta
- Vol. 1 (1) , 4-20
Un algoritmo lineal para el conteo de #2SAT en fórmulas tipo árbol con subfórmulas serial paralelo
Este artículo presenta un algoritmo de tiempo lineal para resolver el problema de conteo #2SAT en fórmulas booleanas de dos formas normales conjuntivas (2-CNF) con una estructura específica. El enfoque se centra en fórmulas cuya representación gráfica forma árboles con subgrafos serie-paralelo en sus nodos interiores u hojas.
- 10 December 2023
- Published by Dirección de Bienes Públicos del Conocimiento, Universidad Autonoma del Estado de Mexico in Informaticae Abstracta
- Vol. 1 (1) , 4-20
Open AccessUn algoritmo lineal para el conteo de #2SAT en fórmulas tipo árbol con subfórmulas serial paralelo
Este artículo presenta un algoritmo de tiempo lineal para resolver el problema de conteo #2SAT en fórmulas booleanas de dos formas normales conjuntivas (2-CNF) con una estructura específica. El enfoque se centra en fórmulas cuya representación gráfica forma árboles con subgrafos serie-paralelo en sus nodos interiores u hojas.
- 30 June 2022
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 26 (2) , 815-822
Computing the Clique-Width on Series-Parallel Graphs
The clique-width (cwd) is an invariant of graphs which, similar to other invariants like the tree-width (twd) establishes a parameter for the complexity of a problem. For example, several problems with bounded clique-width can be solved in polynomial time. There is a well known relation between tree-width and clique-width denoted as cwd(G) ≤ 3 · 2 twd(G)−1 . Serial-parallel graphs have tree-width of at most 2, so its clique–width is at most 6 according to the previous relation. In this paper, we improve the bound for this particular case, showing that the clique-width of series-parallel graphs is smaller or equal to 5.
- 30 June 2022
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 26 (2) , 815-822
Computing the Clique-Width on Series-Parallel Graphs
The clique-width (cwd) is an invariant of graphs which, similar to other invariants like the tree-width (twd) establishes a parameter for the complexity of a problem. For example, several problems with bounded clique-width can be solved in polynomial time. There is a well known relation between tree-width and clique-width denoted as cwd(G) ≤ 3 · 2 twd(G)−1 . Serial-parallel graphs have tree-width of at most 2, so its clique–width is at most 6 according to the previous relation. In this paper, we improve the bound for this particular case, showing that the clique-width of series-parallel graphs is smaller or equal to 5.
- 21 October 2021
- Published by Springer Nature
- p. 337-347
Approximate the Clique-Width of a Graph Using Shortest Paths
- 21 October 2021
- Published by Springer Nature
- p. 337-347
Approximate the Clique-Width of a Graph Using Shortest Paths
- Open Access
- 31 December 2015
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Research in Computing Science
- Vol. 96 (1) , 31-42
Development of an Interpreter for LRT using the Exact Real Number Paradigm
- 31 December 2015
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Research in Computing Science
- Vol. 96 (1) , 31-42
Open AccessDevelopment of an Interpreter for LRT using the Exact Real Number Paradigm