|
Rozklad pravděpodobnostních tabulek representujících boolovské funkce
Vomlel, Jiří
We apply tensor rank-one decompositionnto conditional probability tables representing Boolean functions. We present a numerical algorithm that can be used to find a minimal tensor rank-one decomposition together with the results of the experiments performed using the proposed algorithm. We pay special attention to a family of Boolean functions that are common in probabilistic models from practice - monotone and symmetric Boolean functions.
|
| |
| |
| |
| |
| |