[HTML][HTML] Thirty years of credal networks: Specification, algorithms and complexity

DD Mauá, FG Cozman - International Journal of Approximate Reasoning, 2020 - Elsevier
Credal networks generalize Bayesian networks to allow for imprecision in probability values.
This paper reviews the main results on credal networks under strong independence, as …

[HTML][HTML] Imprecise continuous-time Markov chains

T Krak, J De Bock, A Siebes - International Journal of Approximate …, 2017 - Elsevier
Continuous-time Markov chains are mathematical models that are used to describe the state-
evolution of dynamical systems under stochastic uncertainty, and have found widespread …

Recognizing states of psychological vulnerability to suicidal behavior: a Bayesian network of artificial intelligence applied to a clinical sample

J Barros, S Morales, A García, O Echávarri, R Fischman… - BMC psychiatry, 2020 - Springer
Background This study aimed to determine conditional dependence relationships of
variables that contribute to psychological vulnerability associated with suicide risk. A …

[HTML][HTML] Approximate credal network updating by linear programming with applications to decision making

A Antonucci, CP de Campos, D Huber… - International Journal of …, 2015 - Elsevier
Credal nets are probabilistic graphical models which extend Bayesian nets to cope with sets
of distributions. An algorithm for approximate credal network updating is presented. The …

Probabilistic inference in credal networks: new complexity results

DD Mauá, CP de Campos, A Benavoli… - Journal of Artificial …, 2014 - jair.org
Credal networks are graph-based statistical models whose parameters take values in a set,
instead of being sharply specified as in traditional statistical models (eg, Bayesian …

Average behaviour in discrete-time imprecise Markov chains: A study of weak ergodicity

N T'Joens, J De Bock - International Journal of Approximate Reasoning, 2021 - Elsevier
We study the limit behaviour of upper and lower bounds on expected time averages in
imprecise Markov chains; a generalised type of Markov chain where the local dynamics …

Irrelevant and independent natural extension for sets of desirable gambles

G De Cooman, E Miranda - Journal of Artificial Intelligence Research, 2012 - jair.org
The results in this paper add useful tools to the theory of sets of desirable gambles, a
growing toolbox for reasoning with partial probability assessments. We investigate how to …

[HTML][HTML] Equivalences between maximum a posteriori inference in bayesian networks and maximum expected utility computation in influence diagrams

DD Mauá - International Journal of Approximate Reasoning, 2016 - Elsevier
Two important tasks in probabilistic reasoning are the computation of the maximum posterior
probability of a given subset of the variables in a Bayesian network (MAP), and the …

Statistical matching of discrete data by Bayesian networks

E Endres, T Augustin - Conference on Probabilistic …, 2016 - proceedings.mlr.press
Statistical matching (also known as data fusion, data merging, or data integration) is the
umbrella term for a collection of methods which serve to combine different data sources. The …

Quantifying and Analyzing the Uncertainty in Fault Interpretation Using Entropy

Z Lei - Mathematical Geosciences, 2024 - Springer
Fault interpretation in geology inherently involves uncertainty, which has driven the need to
develop methods to quantify and analyze this uncertainty. This paper introduces a novel …