论文信息 - Fast Factorization of Probability Trees and Its Application to Recursive Trees Learning

Fast Factorization of Probability Trees and Its Application to Recursive Trees Learning

We present a fast potential decomposition algorithm that seeks for proportionality in a probability tree. We give a measure that determines the accuracy of a decomposition in case that exact factorization is not possible. This measure can be used to decide the variable with respect to which a tree should be factorized in order to obtain the most accurate decomposed model.

Antonio Salmerón | Andrés Cano | Cora B. Pérez-Ariza | Manuel Gómez-Olmedo

[1] Serafín Moral,et al. Factorisation of Probability Trees and its Application to Inference in Bayesian Networks , 2002, Probabilistic Graphical Models.

[2] Serafín Moral,et al. Recursive Probability Trees for Bayesian Networks , 2009, CAEPIA.

[3] Serafín Moral,et al. Lazy evaluation in penniless propagation over join trees , 2002, Networks.

[4] Serafín Moral,et al. Approximate Factorisation of Probability Trees , 2005, ECSQARU.

[5] Craig Boutilier,et al. Context-Specific Independence in Bayesian Networks , 1996, UAI.

[6] Anders L. Madsen,et al. LAZY Propagation: A Junction Tree Inference Algorithm Based on Lazy Evaluation , 1999, Artif. Intell..

[7] R. A. Leibler,et al. On Information and Sufficiency , 1951 .