New strategies for finding multiplicative decompositions of probability trees
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 o...
| Main Authors: | , , , |
|---|---|
| Format: | info:eu-repo/semantics/article |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10835/4897 https://doi.org/10.1016/j.amc.2013.10.023 |
| _version_ | 1789406602599596032 |
|---|---|
| author | Martínez, Irene Moral, Serafín Rodríguez, Carmelo Salmerón Cerdán, Antonio |
| author_facet | Martínez, Irene Moral, Serafín Rodríguez, Carmelo Salmerón Cerdán, Antonio |
| author_sort | Martínez, Irene |
| collection | DSpace |
| description | 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. |
| format | info:eu-repo/semantics/article |
| id | oai:repositorio.ual.es:10835-4897 |
| institution | Universidad de Cuenca |
| language | English |
| publishDate | 2017 |
| record_format | dspace |
| spelling | oai:repositorio.ual.es:10835-48972023-04-12T19:38:47Z New strategies for finding multiplicative decompositions of probability trees Martínez, Irene Moral, Serafín Rodríguez, Carmelo Salmerón Cerdán, Antonio Probability trees Multiplicative factorisation Approximation 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. 2017-07-07T07:17:52Z 2017-07-07T07:17:52Z 2013 info:eu-repo/semantics/article http://hdl.handle.net/10835/4897 https://doi.org/10.1016/j.amc.2013.10.023 en Attribution-NonCommercial-NoDerivatives 4.0 Internacional http://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess |
| spellingShingle | Probability trees Multiplicative factorisation Approximation Martínez, Irene Moral, Serafín Rodríguez, Carmelo Salmerón Cerdán, Antonio New strategies for finding multiplicative decompositions of probability trees |
| title | New strategies for finding multiplicative decompositions of probability trees |
| title_full | New strategies for finding multiplicative decompositions of probability trees |
| title_fullStr | New strategies for finding multiplicative decompositions of probability trees |
| title_full_unstemmed | New strategies for finding multiplicative decompositions of probability trees |
| title_short | New strategies for finding multiplicative decompositions of probability trees |
| title_sort | new strategies for finding multiplicative decompositions of probability trees |
| topic | Probability trees Multiplicative factorisation Approximation |
| url | http://hdl.handle.net/10835/4897 https://doi.org/10.1016/j.amc.2013.10.023 |
| work_keys_str_mv | AT martinezirene newstrategiesforfindingmultiplicativedecompositionsofprobabilitytrees AT moralserafin newstrategiesforfindingmultiplicativedecompositionsofprobabilitytrees AT rodriguezcarmelo newstrategiesforfindingmultiplicativedecompositionsofprobabilitytrees AT salmeroncerdanantonio newstrategiesforfindingmultiplicativedecompositionsofprobabilitytrees |