Show simple item record

dc.contributor.authorMartínez, Irene
dc.contributor.authorMoral, Serafín
dc.contributor.authorRodríguez, Carmelo
dc.contributor.authorSalmerón Cerdán, Antonio
dc.date.accessioned2017-07-07T07:17:52Z
dc.date.available2017-07-07T07:17:52Z
dc.date.issued2013
dc.identifier.urihttp://hdl.handle.net/10835/4897
dc.description.abstractProbability 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.es_ES
dc.language.isoenes_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectProbability treeses_ES
dc.subjectMultiplicative factorisationes_ES
dc.subjectApproximationes_ES
dc.titleNew strategies for finding multiplicative decompositions of probability treeses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
dc.identifier.doihttps://doi.org/10.1016/j.amc.2013.10.023


Files in this item

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Internacional