Binary Probability Trees for Bayesian Networks Inference

Author(s):  
Andrés Cano ◽  
Manuel Gómez-Olmedo ◽  
Serafín Moral
2011 ◽  
Vol 52 (1) ◽  
pp. 49-62 ◽  
Author(s):  
Andrés Cano ◽  
Manuel Gémez-Olmedo ◽  
Serafén Moral

Author(s):  
Andrés Cano ◽  
Manuel Gómez-Olmedo ◽  
Serafín Moral ◽  
Cora B. Pérez-Ariza

Author(s):  
ANDRÉS CANO ◽  
MANUEL GÓMEZ-OLMEDO ◽  
CORA B. PÉREZ-ARIZA ◽  
ANTONIO SALMERÓN

We present an efficient procedure for factorising probabilistic potentials represented as probability trees. This new procedure is able to detect some regularities that cannot be captured by existing methods. In cases where an exact decomposition is not achievable, we propose a heuristic way to carry out approximate factorisations guided by a parameter called factorisation degree, which is fast to compute. We show how this parameter can be used to control the tradeoff between complexity and accuracy in approximate inference algorithms for Bayesian networks.


Author(s):  
Xavier Ponseti ◽  
Pedro L. Almeida ◽  
Joao Lameiras ◽  
Bruno Martins ◽  
Aurelio Olmedilla-Zafra ◽  
...  

This study is framed on the Information Theory as a constructive criterion to generate probabilistic distributions –through the elaboration of Bayesian Networks- and to reduce the uncertainty in the occurrence and relationship between two key psychological variables associated with the sports’ performance: Self-Determined Motivation and Competitive Anxiety. We analyzed 674 universitary students/athletes who competed in the 2017 Universitary Games (Universiade) in México, from 44 universities, with an average age of 21 years old (SD = 2.07), and with a sportive experience of 8.61 years of average (SD = 5.15). Methods: Regarding the data analysis, first of all a CHAID algorithm was carried out for to know the independence links among variables, and then two Bayesian networks (BN) were elaborated. The validation of the BN revealed AUC values ranging from 0.5 to 0.92. Subsequently, various instantations were carried out with hypothetical values applied to the “bottom” variables. Results showed two probability trees that have Extrinisic Motivation and Amotivation at the top, while the anxiety/activation due to the worry for performance was at the bottom of probabilities. The instantiations carried out support the existence of these probabilistic relationships, demonstrating the little influence on the competition anxiety generated by the intrinsic motivation. In conclusion, the reduction of the uncertainty made up by the restricted BN may aloe to re-introduce Information Theory principles in psychosocial studies, allowing authors to obtain useful probabilities values upon target psychological variables related with sportive performance.


2000 ◽  
Vol 34 (4) ◽  
pp. 387-413 ◽  
Author(s):  
Antonio Salmerón ◽  
Andrés Cano ◽  
Serafı́n Moral

Author(s):  
Andrés Cano ◽  
Manuel Gómez-Olmedo ◽  
Serafín Moral ◽  
Serafín Moral-García

Given a set of uncertain discrete variables with a joint probability distribution and a set of observations for some of them, the most probable explanation is a set or configuration of values for non-observed variables maximizing the conditional probability of these variables given the observations. This is a hard problem which can be solved by a deletion algorithm with max marginalization, having a complexity similar to the one of computing conditional probabilities. When this approach is unfeasible, an alternative is to carry out an approximate deletion algorithm, which can be used to guide the search of the most probable explanation, by using A* or branch and bound (the approximate+search approach). The most common approximation procedure has been the mini-bucket approach. In this paper it is shown that the use of probability trees as representation of potentials with a pruning of branches with similar values can improve the performance of this procedure. This is corroborated with an experimental study in which computation times are compared using randomly generated and benchmark Bayesian networks from UAI competitions.


2013 ◽  
Vol 28 (7) ◽  
pp. 623-647 ◽  
Author(s):  
Andrés Cano ◽  
Manuel Gómez-Olmedo ◽  
Serafín Moral ◽  
Cora B. Pérez-Ariza ◽  
Antonio Salmerón

Sign in / Sign up

Export Citation Format

Share Document