Založeno v roce 2005 s podporou MŠMT ČR (projekt 1M0572)

Publikace

Tensor rank-one decomposition of probability tables.

Typ:
Konferenční příspěvek
Autoři publikace:
Vomlel J., Savický P.
Název sborniku:
Proceedings of the 11th International Conference on Information Processing and Management of Uncertianlty in Konowledge-based Systems.
Nakladatel:
Bouchon-Meunier B., Yager R. R. eds.
Místo vydání:
Paris
Rok:
2006
Strany:
2292-2299
Klíčová slova:
graphical probabilistic models, probabilistic inference
Anotace:
We propose a new additive decomposition of probability tables - tensor rank-one decomposition. The basic idea is to decompose a probability table into a series of tables, such that the table that is the sum of the series is equal to the original table. Each table in the series has the same domain as the original table but can be expressed as a product of onedimensional tables. We show that tensor rank-one decomposition can be used to reduce the space and time requirements in probabilistic inference. We provide a closed form solution for minimal tensor rank-one decomposition for some special tables.
 
Copyright 2005 DAR XHTML CSS