Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
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 c...
| Huvudupphovsmän: | , , , |
|---|---|
| Materialtyp: | info:eu-repo/semantics/article |
| Språk: | English |
| Publicerad: |
2017
|
| Ämnen: | |
| Länkar: | http://hdl.handle.net/10835/4885 https://doi.org/10.1142/S0218488512500110 |