Konferenční příspěvek

Proceedings of Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty /10./

UTIA AV ČR

Praha

2007

Ing. Václav Kratochvíl (ÚTIA - Oddělení matematické teorie rozhodování)

compositional model, marginalization, reduction

This paper deals with the problem of marginalization of multidimensional probability distributions represented by a compositional model. By the perfect one in this case. From the computational point of view this solution is more efficient than any known marginalization process for Bayesian models. This is because the process mentioned in the paper in a form of an algorithm and takes an advantage of the fact that the perfect sequence models have some information encoded; if can be obtained from the Bayesian networks by an application of rather computationally expensive procedures. One part of that algorithm is marginalization by means of reduction. This paper describe a new faster algorithm to find a reduction in a compositional model.