|
Motivace různých charakterizací ekvivalentních persegramů
Kratochvíl, Václav
In this paper we give the motivation and introduction for indirect characterization of equivalence. We have found three operations on persegram remaining induced independence model. By combining them together, one can generate a class of equivalent models. We are not sure whether one can generate the whole class. This problem is closely connected with the above mentioned problem of invariant properties.
|
|
Problém ekvivalentu v kompozitních modelech
Kratochvíl, Václav
Structure of each Compositional model can be visualized by a tool called persegram. Every persegram over a finite non-empty set of variables N induces an independence model over N, which is a list of conditional independence statements over N. The Equivalence problem is how to characterize (in graphical terms) whether all independence statements in the model induced by persegram P are in the model induced by a second persegram P' and vice versa. Three different operations preserving independence model were introduced in previous papers. If combined, one is able to generate the (whole) class of equivalent persegrams. This characterization is indirect: Two persegrams P,P' are equivalent if there exists a sequence of persegrams from P,P' such that only so called IE-operations are performed to get next persegram in the sequence. In this paper we give the motivation and introduction for direct characterization of equivalence.
|
|
Efektivní algoritmus na hledání redukcí v kompozicionálních modelech
Kratochvíl, Václav
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.
|
| |