Learning recursive probability trees from probabilistic potentials
A recursive probability tree (RPT) is an incipient data structure for representing the distributions in a probabilistic graphical model. RPTs capture most of the types of independencies found in a probability distribution. The explicit representation of these features using RPTs simplifies computati...
Main Authors: | Cano, Andrés, Gómez Olmedo, Manuel, Moral, Serafín, Pérez-Ariza, Cora B., Salmerón Cerdán, Antonio |
---|---|
Format: | info:eu-repo/semantics/report |
Language: | English |
Published: |
2012
|
Online Access: | http://hdl.handle.net/10835/1549 |
Similar Items
-
Factorisation of Probability Trees and its Applications
by: Martínez, Irene, et al.
Published: (2012) -
Dynamic Importance Sampling in Bayesian Networks Based on Probability Trees
by: Moral, Serafín, et al.
Published: (2017) -
New strategies for finding multiplicative decompositions of probability trees
by: Martínez, Irene, et al.
Published: (2017) -
Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
by: Cano, Andrés, et al.
Published: (2017) -
Tree Cover Estimation in Global Drylands from Space Using Deep Learning
by: Guirado Hernández, Emilio, et al.
Published: (2020)