Manuel Gómez-Olmedo
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
Manuel Gómez-Olmedo has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Andrés Cano
Computer Science and Artificial Intelligent Department, University of Granada, 18071 Granada, Spain
28 shared publications - Rafael Cabañas
Department of Mathematics and CDTIME, University of Almería, Almería, Spain
10 shared publications Serafín Moral
10 shared publications- Serafín Moral
Department of Computer Science and Artificial Intelligence, University of Granada, 18071 Granada, Spain
9 shared publications - Concha Bielza
Universidad Politécnica de Madrid
6 shared publications - Antonio Salmerón
University of Almeria
5 shared publications
Latest Publications
- Open Access
- 19 April 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 198
Computing conditional probabilities in Bayesian networks using logistic regression
- 19 April 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 198
Open AccessComputing conditional probabilities in Bayesian networks using logistic regression
- Open Access
- 24 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 26130-26141
Toward Variational Structural Learning of Bayesian Networks
THIS study presents a novel variational framework for structural learning in Bayesian networks (BNs), addressing the key limitation of existing Bayesian methods: their lack of scalability to large graphs with many variables. Traditional approaches, such as MCMC and stochastic search, often encounter computational barriers due to the super-exponential growth of the Directed Acyclic Graph (DAG) space. Our method introduces a scalable alternative by leveraging a factorized variational family to approximate the posterior distribution over DAG structures, enabling efficient computation of Bayesian scores and predictive posterior inference. Unlike previous methods, which are constrained by high computational costs or domain-specific limitations, this approach achieves tractability through mean-field variational inference and tractable updating equations, allowing application to significantly larger datasets. Empirical results on benchmark datasets demonstrate that the proposed framework consistently outperforms state-of-the-art methods in terms of scalability and predictive accuracy while maintaining robustness across diverse scenarios. This work represents a key step towards scalable Bayesian structural learning and opens avenues for future research to refine the variational approximation and incorporate advanced parallelization techniques.
- 24 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 26130-26141
Open AccessToward Variational Structural Learning of Bayesian Networks
THIS study presents a novel variational framework for structural learning in Bayesian networks (BNs), addressing the key limitation of existing Bayesian methods: their lack of scalability to large graphs with many variables. Traditional approaches, such as MCMC and stochastic search, often encounter computational barriers due to the super-exponential growth of the Directed Acyclic Graph (DAG) space. Our method introduces a scalable alternative by leveraging a factorized variational family to approximate the posterior distribution over DAG structures, enabling efficient computation of Bayesian scores and predictive posterior inference. Unlike previous methods, which are constrained by high computational costs or domain-specific limitations, this approach achieves tractability through mean-field variational inference and tractable updating equations, allowing application to significantly larger datasets. Empirical results on benchmark datasets demonstrate that the proposed framework consistently outperforms state-of-the-art methods in terms of scalability and predictive accuracy while maintaining robustness across diverse scenarios. This work represents a key step towards scalable Bayesian structural learning and opens avenues for future research to refine the variational approximation and incorporate advanced parallelization techniques.
- Open Access
- 23 April 2023
- Published by Elsevier in Information Sciences
- Vol. 638
Imprecise probabilistic models based on hierarchical intervals
- 23 April 2023
- Published by Elsevier in Information Sciences
- Vol. 638
Open AccessImprecise probabilistic models based on hierarchical intervals
- Open Access
- 21 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (14) , 2542
Using Value-Based Potentials for Making Approximate Inference on Probabilistic Graphical Models
The computerization of many everyday tasks generates vast amounts of data, and this has lead to the development of machine-learning methods which are capable of extracting useful information from the data so that the data can be used in future decision-making processes. For a long time now, a number of fields, such as medicine (and all healthcare-related areas) and education, have been particularly interested in obtaining relevant information from this stored data. This interest has resulted in the need to deal with increasingly complex problems which involve many different variables with a high degree of interdependency. This produces models (and in our case probabilistic graphical models) that are difficult to handle and that require very efficient techniques to store and use the information that quantifies the relationships between the problem variables. It has therefore been necessary to develop efficient structures, such as probability trees or value-based potentials, to represent the information. Even so, there are problems that must be treated using approximation since this is the only way that results can be obtained, despite the corresponding loss of information. The aim of this article is to show how the approximation can be performed with value-based potentials. Our experimental work is based on checking the behavior of this approximation technique on several Bayesian networks related to medical problems, and our experiments show that in some cases there are notable savings in memory space with limited information loss.
- 21 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (14) , 2542
Open AccessUsing Value-Based Potentials for Making Approximate Inference on Probabilistic Graphical Models
The computerization of many everyday tasks generates vast amounts of data, and this has lead to the development of machine-learning methods which are capable of extracting useful information from the data so that the data can be used in future decision-making processes. For a long time now, a number of fields, such as medicine (and all healthcare-related areas) and education, have been particularly interested in obtaining relevant information from this stored data. This interest has resulted in the need to deal with increasingly complex problems which involve many different variables with a high degree of interdependency. This produces models (and in our case probabilistic graphical models) that are difficult to handle and that require very efficient techniques to store and use the information that quantifies the relationships between the problem variables. It has therefore been necessary to develop efficient structures, such as probability trees or value-based potentials, to represent the information. Even so, there are problems that must be treated using approximation since this is the only way that results can be obtained, despite the corresponding loss of information. The aim of this article is to show how the approximation can be performed with value-based potentials. Our experimental work is based on checking the behavior of this approximation technique on several Bayesian networks related to medical problems, and our experiments show that in some cases there are notable savings in memory space with limited information loss.
- Open Access
Computation of Kullback–Leibler Divergence in Bayesian Networks
Kullback–Leibler divergence is the standard measure of error when we have a true probability distribution p which is approximate with probability distribution q. Its efficient computation is essential in many tasks, as in approximate computation or as a measure of error when learning a probability. In high dimensional probabilities, as the ones associated with Bayesian networks, a direct computation can be unfeasible. This paper considers the case of efficiently computing the Kullback–Leibler divergence of two probability distributions, each one of them coming from a different Bayesian network, which might have different structures. The paper is based on an auxiliary deletion algorithm to compute the necessary marginal distributions, but using a cache of operations with potentials in order to reuse past computations whenever they are necessary. The algorithms are tested with Bayesian networks from the bnlearn repository. Computer code in Python is provided taking as basis pgmpy, a library for working with probabilistic graphical models.Open AccessComputation of Kullback–Leibler Divergence in Bayesian Networks
Kullback–Leibler divergence is the standard measure of error when we have a true probability distribution p which is approximate with probability distribution q. Its efficient computation is essential in many tasks, as in approximate computation or as a measure of error when learning a probability. In high dimensional probabilities, as the ones associated with Bayesian networks, a direct computation can be unfeasible. This paper considers the case of efficiently computing the Kullback–Leibler divergence of two probability distributions, each one of them coming from a different Bayesian network, which might have different structures. The paper is based on an auxiliary deletion algorithm to compute the necessary marginal distributions, but using a cache of operations with potentials in order to reuse past computations whenever they are necessary. The algorithms are tested with Bayesian networks from the bnlearn repository. Computer code in Python is provided taking as basis pgmpy, a library for working with probabilistic graphical models. - Open Access
- 26 July 2021
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 36 (11) , 6913-6943
Value‐based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models
- 26 July 2021
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 36 (11) , 6913-6943
Open AccessValue‐based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models
- 5 June 2020
- Published by Springer Nature
- Vol. 1238, 151-164
Learning Sets of Bayesian Networks
This paper considers the problem of learning a generalized credal network (a set of Bayesian networks) from a dataset. It is based on using the BDEu score and computes all the networks with score above a predetermined factor of the optimal one. To avoid the problem of determining the equivalent sample size (ESS), the approach also considers the possibility of an undetermined ESS. Even if the final result is a set of Bayesian networks, the paper also studies the problem of selecting a single network with some alternative procedures. Finally, some preliminary experiments are carried out with three small networks.
- 5 June 2020
- Published by Springer Nature
- Vol. 1238, 151-164
Learning Sets of Bayesian Networks
This paper considers the problem of learning a generalized credal network (a set of Bayesian networks) from a dataset. It is based on using the BDEu score and computes all the networks with score above a predetermined factor of the optimal one. To avoid the problem of determining the equivalent sample size (ESS), the approach also considers the possibility of an undetermined ESS. Even if the final result is a set of Bayesian networks, the paper also studies the problem of selecting a single network with some alternative procedures. Finally, some preliminary experiments are carried out with three small networks.
- 1 December 2019
- Published by Elsevier in Knowledge-Based Systems
- Vol. 185
A Bayesian approach to abrupt concept drift
- 1 December 2019
- Published by Elsevier in Knowledge-Based Systems
- Vol. 185
A Bayesian approach to abrupt concept drift
- 18 May 2018
- Published by Springer Nature
- p. 616-628
Virtual Subconcept Drift Detection in Discrete Data Using Probabilistic Graphical Models
- 18 May 2018
- Published by Springer Nature
- p. 616-628
Virtual Subconcept Drift Detection in Discrete Data Using Probabilistic Graphical Models
- 14 September 2017
- Published by Springer Nature
- p. 107-118
Estimating Conditional Probabilities by Mixtures of Low Order Conditional Distributions
- 14 September 2017
- Published by Springer Nature
- p. 107-118
Estimating Conditional Probabilities by Mixtures of Low Order Conditional Distributions