New strategies for finding multiplicative decompositions of probability trees
Ficheros
Identificadores
URI: http://hdl.handle.net/10835/4897
DOI: https://doi.org/10.1016/j.amc.2013.10.023
DOI: https://doi.org/10.1016/j.amc.2013.10.023
Compartir
Metadatos
Mostrar el registro completo del ítemFecha
2013Resumen
Probability trees are a powerful data structure for representing probabilistic potentials. However, their complexity can become intractable if they represent a probability distribution over a large set of variables. In this paper, we study the problem of decomposing a probability tree as a product of smaller trees, with the aim of being able to handle bigger probabilistic potentials. We propose exact and approximate approaches and evaluate their behaviour through an extensive set of experiments.
Palabra/s clave
Probability trees
Multiplicative factorisation
Approximation