• Corpus ID: 221135319

CREMA: A Java Library for Credal Network Inference

@inproceedings{Huber2020CREMAAJ,
  title={CREMA: A Java Library for Credal Network Inference},
  author={David Huber and Rafael Caba{\~n}as and Marco Zaffalon},
  booktitle={PGM},
  year={2020}
}
We present CREMA (Credal Models Algorithms), a Java library for inference in credal networks. These models are analogous to Bayesian networks, but their local parameters are only constrained to vary in, so-called credal, sets. Inference in credal networks is intended as the computation of the bounds of a query with respect to those local variations. For credal networks the task is harder than in Bayesian networks, being NPPP-hard in general models. Yet, scalable approximate algorithms have been… 

Figures from this paper

CREPO: An Open Repository to Benchmark Credal Network Algorithms
TLDR
CREPO is presented, an open repository of synthetic credal networks, provided together with the exact results of inference tasks on these models, and an approximate heuristic to be used inside variable elimination schemes to keep a bound on the maximum number of vertices generated during the combination step is proposed.
CREDICI: A Java Library for Causal Inference by Credal Networks
TLDR
Credal networks are an extension of Bayesian networks where local probability mass functions are only constrained to belong to given, so-called credal, sets and CREDICI is based on the recent work of Zaffalon et al. (2020), where an equivalence between Pearl's structural causal models and credal networks has been derived.
Robustness Guarantees for Credal Bayesian Networks via Constraint Relaxation over Probabilistic Circuits
TLDR
This work develops a method to quantify the robustness of decision functions with respect to credal Bayesian networks, formal parametric models of the environment where uncertainty is expressed through credal sets on the parameters.
A New Score for Adaptive Tests in Bayesian and Credal Networks
TLDR
This work presents an alternative family of scores, based on the mode of the posterior probabilities, and hence easier to explain, that makes considerably simpler the evaluation in the credal case, without significantly affecting the quality of the adaptive process.
ADAPQUEST: A Software for Web-Based Adaptive Questionnaires based on Bayesian Networks
TLDR
ADAPQUEST, a software tool written in Java for the development of adaptive questionnaires based on Bayesian networks, is introduced and an application of this tool for the diagnosis of mental disorders is discussed.
A comparison bewteen Elvira software and AMIDST toolbox in environmental data: A case study of flooding risk management
TLDR
A comparison between Elvira software and AMIDST toolbox is made using data from a flood risk modelling example to explore new and more powerful tools, like AMIDsST, for environmental modelling tasks.

References

SHOWING 1-8 OF 8 REFERENCES
Updating credal networks is approximable in polynomial time
Approximate credal network updating by linear programming with applications to decision making
Credal networks
Probabilistic Inference in Credal Networks: New Complexity Results
TLDR
It is shown that inferences under strong independence are NP-hard even in trees with binary variables except for a single ternary one, and it is proved that under epistemic irrelevance the polynomial-time complexity of inferences in credal trees is not likely to extend to more general models.
Probabilistic Graphical Models - Principles and Techniques
TLDR
The framework of probabilistic graphical models, presented in this book, provides a general approach for causal reasoning and decision making under uncertainty, allowing interpretable models to be constructed and then manipulated by reasoning algorithms.
2U: An Exact Interval Propagation Algorithm for Polytrees with Binary Variables
Parallel Extreme Ray and Pathway Computation
TLDR
This work presents and compares two approaches for the parallel enumeration of extreme rays, both based on the double description method, and introduces a born/die matrix to store intermediary results, allowing for parallelization across several iteration steps.