Ignacio Segovia-Dominguez
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
Ignacio Segovia-Dominguez has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
Arturo Hernandez-Aguirre
Center for Research in Mathematics, Guanajuato, México
3 shared publications- Sergio Ivvan Valdez
Centro de Investigación en Ciencias de Información Geoespacial
3 shared publications Arturo Hernández Aguirre
Center for Research in Mathematics
2 shared publicationsArturo Hernández-Aguirre
2 shared publications- Yulia R. Gel
Virginia Tech, Blacksburg, Virginia, USA
2 shared publications - Abdullah-Al-Raihan Nayeem
University of North Carolina at Charlotte North Carolina USA
1 shared publication
Latest Publications
- Open Access
Learning on Health Fairness and Environmental Justice via Interactive Visualization
This paper introduces an interactive visualization interface with a machine learning consensus analysis that enables the researchers to explore the impact of atmospheric and socioeconomic factors on COVID-19 clinical severity by employing multiple Recurrent Graph Neural Networks. We designed and implemented a visualization interface that leverages coordinated multi-views to support exploratory and predictive analysis of hospitalizations and other socio-geographic variables at multiple dimensions, simultaneously. By harnessing the strength of geometric deep learning, we build a consensus machine learning model to include knowledge from county-level records and investigate the complex interrelationships between global infectious disease, environment, and social justice. Additionally, we make use of unique NASA satellite-based observations which are not broadly used in the context of climate justice applications. Our current interactive interface focus on three US states (California, Pennsylvania, and Texas) to demonstrate its scientific value and presented three case studies to make qualitative evaluations.
Open AccessLearning on Health Fairness and Environmental Justice via Interactive Visualization
This paper introduces an interactive visualization interface with a machine learning consensus analysis that enables the researchers to explore the impact of atmospheric and socioeconomic factors on COVID-19 clinical severity by employing multiple Recurrent Graph Neural Networks. We designed and implemented a visualization interface that leverages coordinated multi-views to support exploratory and predictive analysis of hospitalizations and other socio-geographic variables at multiple dimensions, simultaneously. By harnessing the strength of geometric deep learning, we build a consensus machine learning model to include knowledge from county-level records and investigate the complex interrelationships between global infectious disease, environment, and social justice. Additionally, we make use of unique NASA satellite-based observations which are not broadly used in the context of climate justice applications. Our current interactive interface focus on three US states (California, Pennsylvania, and Texas) to demonstrate its scientific value and presented three case studies to make qualitative evaluations.
- Open Access
ToDD: Topological Compound Fingerprinting in Computer-Aided Drug Discovery
In computer-aided drug discovery (CADD), virtual screening (VS) is used for identifying the drug candidates that are most likely to bind to a molecular target in a large library of compounds. Most VS methods to date have focused on using canonical compound representations (e.g., SMILES strings, Morgan fingerprints) or generating alternative fingerprints of the compounds by training progressively more complex variational autoencoders (VAEs) and graph neural networks (GNNs). Although VAEs and GNNs led to significant improvements in VS performance, these methods suffer from reduced performance when scaling to large virtual compound datasets. The performance of these methods has shown only incremental improvements in the past few years. To address this problem, we developed a novel method using multiparameter persistence (MP) homology that produces topological fingerprints of the compounds as multidimensional vectors. Our primary contribution is framing the VS process as a new topology-based graph ranking problem by partitioning a compound into chemical substructures informed by the periodic properties of its atoms and extracting their persistent homology features at multiple resolution levels. We show that the margin loss fine-tuning of pretrained Triplet networks attains highly competitive results in differentiating between compounds in the embedding space and ranking their likelihood of becoming effective drug candidates. We further establish theoretical guarantees for the stability properties of our proposed MP signatures, and demonstrate that our models, enhanced by the MP signatures, outperform state-of-the-art methods on benchmark datasets by a wide and highly statistically significant margin (e.g., 93% gain for Cleves-Jain and 54% gain for DUD-E Diverse dataset).
Open AccessToDD: Topological Compound Fingerprinting in Computer-Aided Drug Discovery
In computer-aided drug discovery (CADD), virtual screening (VS) is used for identifying the drug candidates that are most likely to bind to a molecular target in a large library of compounds. Most VS methods to date have focused on using canonical compound representations (e.g., SMILES strings, Morgan fingerprints) or generating alternative fingerprints of the compounds by training progressively more complex variational autoencoders (VAEs) and graph neural networks (GNNs). Although VAEs and GNNs led to significant improvements in VS performance, these methods suffer from reduced performance when scaling to large virtual compound datasets. The performance of these methods has shown only incremental improvements in the past few years. To address this problem, we developed a novel method using multiparameter persistence (MP) homology that produces topological fingerprints of the compounds as multidimensional vectors. Our primary contribution is framing the VS process as a new topology-based graph ranking problem by partitioning a compound into chemical substructures informed by the periodic properties of its atoms and extracting their persistent homology features at multiple resolution levels. We show that the margin loss fine-tuning of pretrained Triplet networks attains highly competitive results in differentiating between compounds in the embedding space and ranking their likelihood of becoming effective drug candidates. We further establish theoretical guarantees for the stability properties of our proposed MP signatures, and demonstrate that our models, enhanced by the MP signatures, outperform state-of-the-art methods on benchmark datasets by a wide and highly statistically significant margin (e.g., 93% gain for Cleves-Jain and 54% gain for DUD-E Diverse dataset).
- 1 April 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 144
Geometric probabilistic evolutionary algorithm
- 1 April 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 144
Geometric probabilistic evolutionary algorithm
- Open Access
- 1 July 2019
- Published by Universidad Nacional Autonoma de Mexico in Atmósfera
- Vol. 32 (3) , 237-259
Analysis of a new spatial interpolation weighting method to estimate missing data applied to rainfall records
Analysis of a new spatial interpolation weighting method to estimate missing data applied to rainfall records
- 1 July 2019
- Published by Universidad Nacional Autonoma de Mexico in Atmósfera
- Vol. 32 (3) , 237-259
Open AccessAnalysis of a new spatial interpolation weighting method to estimate missing data applied to rainfall records
Analysis of a new spatial interpolation weighting method to estimate missing data applied to rainfall records
- Open Access
- 11 July 2015
- Published by Association for Computing Machinery (ACM)
- p. 527-534
An Estimation of Distribution Algorithm based on the Natural Gradient and the Boltzmann Distribution
This paper introduces an Estimation of Distribution Algorithm (EDA), in which the parameters of the search distribution are updated by the natural gradient technique. The parameter updating is guided via the Kullback-Leibler divergence between the multivariate Normal and the Boltzmann densities. This approach makes sense because it is well-known that the Boltzmann function yields a reliable model to simulate particles near to optimum locations. Three main contributions are presented here in order to build an effective EDA. The first one is a natural gradient formula which allows for an update of the parameters of a density function. These equations are related to an exponential parametrization of the search distribution. The second contribution involves the approximation of the developed gradient formula and its connection to the importance sampling method. The third contribution is a parameter update rule which is designed to control the exploration and exploitation phases of the algorithm. The proposed EDA is tested on a benchmark of 16 problems and compared versus the XNES and iAMaLGaM algorithms. The statistical results show that the performance of the proposed method is competitive and it is the winner in several problems.
- 11 July 2015
- Published by Association for Computing Machinery (ACM)
- p. 527-534
Open AccessAn Estimation of Distribution Algorithm based on the Natural Gradient and the Boltzmann Distribution
This paper introduces an Estimation of Distribution Algorithm (EDA), in which the parameters of the search distribution are updated by the natural gradient technique. The parameter updating is guided via the Kullback-Leibler divergence between the multivariate Normal and the Boltzmann densities. This approach makes sense because it is well-known that the Boltzmann function yields a reliable model to simulate particles near to optimum locations. Three main contributions are presented here in order to build an effective EDA. The first one is a natural gradient formula which allows for an update of the parameters of a density function. These equations are related to an exponential parametrization of the search distribution. The second contribution involves the approximation of the developed gradient formula and its connection to the importance sampling method. The third contribution is a parameter update rule which is designed to control the exploration and exploitation phases of the algorithm. The proposed EDA is tested on a benchmark of 16 problems and compared versus the XNES and iAMaLGaM algorithms. The statistical results show that the performance of the proposed method is competitive and it is the winner in several problems.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2082-2089
Designing the Boltzmann estimation of multivariate normal distribution: Issues, goals and solutions
This paper introduces a new Estimation of Distribution Algorithm (EDA) based on the multivariate Boltzmann distribution. In this work, the design variables and the energy function of the Boltzmann distribution are continuous. Note that since the population has finite size, it can only approximate a continuous Boltzmann distribution with some error. In order to tackle this issue, the parameter estimators for the mean vector and covariance matrix of a Multivariate Normal Density that approximate the Boltzmann density, are derived by minimizing the Kullback-Leibler divergence. The algorithm introduced here uses one energy function for the mean estimator and another for the covariance matrix estimator. The first function places the probability mass around the most promising regions by assigning larger weights to individuals with higher fitness. However, the second function orients the covariance matrix along improving directions by assigning larger weights to individuals with lower fitness. Our proposal combines the conveniences of linear weights with a simple annealing schedule to regulate the exploration and exploitation of the search process. The resulting algorithm is named the Boltzmann Estimation of Multivariate Normal Algorithm (BEMNA). By applying the developed formulae the BEMNA is capable of adapting the structure of a density model to the promisory search directions. BEMNA is tested with a benchmark of 16 functions and contrasted with the AMaLGaM algorithm, a state of the art EDA. Statistical tests of the experimental data show the competitiveness of the proposed algorithm.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2082-2089
Designing the Boltzmann estimation of multivariate normal distribution: Issues, goals and solutions
This paper introduces a new Estimation of Distribution Algorithm (EDA) based on the multivariate Boltzmann distribution. In this work, the design variables and the energy function of the Boltzmann distribution are continuous. Note that since the population has finite size, it can only approximate a continuous Boltzmann distribution with some error. In order to tackle this issue, the parameter estimators for the mean vector and covariance matrix of a Multivariate Normal Density that approximate the Boltzmann density, are derived by minimizing the Kullback-Leibler divergence. The algorithm introduced here uses one energy function for the mean estimator and another for the covariance matrix estimator. The first function places the probability mass around the most promising regions by assigning larger weights to individuals with higher fitness. However, the second function orients the covariance matrix along improving directions by assigning larger weights to individuals with lower fitness. Our proposal combines the conveniences of linear weights with a simple annealing schedule to regulate the exploration and exploitation of the search process. The resulting algorithm is named the Boltzmann Estimation of Multivariate Normal Algorithm (BEMNA). By applying the developed formulae the BEMNA is capable of adapting the structure of a density model to the promisory search directions. BEMNA is tested with a benchmark of 16 functions and contrasted with the AMaLGaM algorithm, a state of the art EDA. Statistical tests of the experimental data show the competitiveness of the proposed algorithm.
- 1 January 2014
- Published by INSTICC
- p. 251-258
A Boltzmann Multivariate Estimation of Distribution Algorithm for Continuous Optimization
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.
- 1 January 2014
- Published by INSTICC
- p. 251-258
A Boltzmann Multivariate Estimation of Distribution Algorithm for Continuous Optimization
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 352-361
A New EDA by a Gradient-Driven Density
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 352-361
A New EDA by a Gradient-Driven Density
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 33 (1089778X) , 1702-1709
Building multivariate density functions based on promising direction vectors
In this paper we introduce a method to build a large variety of multivariate density functions based on univariate distributions and promising direction vectors. The stochastic model constructed in our proposal simulates random vector towards directions with high probability of improving the population. Also, we provide two algorithms to use this ideas in the global optimization problem. The first one is a Hybrid Estimation of Distribution Algorithm and the second one is the Adaptive Basis of Evolution Strategy. Both algorithms are tested and show a good performance in a set of benchmark problems, even outperforming popular competitive algorithms. In the best of our knowledge, the central idea described here is not in previous literature about global optimization.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 33 (1089778X) , 1702-1709
Building multivariate density functions based on promising direction vectors
In this paper we introduce a method to build a large variety of multivariate density functions based on univariate distributions and promising direction vectors. The stochastic model constructed in our proposal simulates random vector towards directions with high probability of improving the population. Also, we provide two algorithms to use this ideas in the global optimization problem. The first one is a Hybrid Estimation of Distribution Algorithm and the second one is the Adaptive Basis of Evolution Strategy. Both algorithms are tested and show a good performance in a set of benchmark problems, even outperforming popular competitive algorithms. In the best of our knowledge, the central idea described here is not in previous literature about global optimization.
- 1 January 2013
- Published by Springer Nature
- p. 123-153
The Gaussian Polytree EDA with Copula Functions and Mutations
- 1 January 2013
- Published by Springer Nature
- p. 123-153
The Gaussian Polytree EDA with Copula Functions and Mutations