Home > Search Results: keywords:"tensor rank-one decomposition"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Aplikace bayesovských sítích ve hře Minesweepe
 Vomlelová, M. ; Vomlel, Jiří
We use the computer game of Minesweeper to illustrate few modeling tricks utilized when applying Bayesian network (BN) models in real applications. Among others, we apply rank-one decomposition (ROD) toconditional probability tables (CPTs) representing addition. Typically, this transformation helps to reduce the computational complexity of probabilistic inference with the BN model. However, in this paper we will see that (except for the total sum node) when ROD is applied to the whole CPT it does not bring any savings for the BN model of Minesweeper. Actually, in order to gain from ROD we need minimal rank-one decompositions of CPTs when the state of the dependent variable is observed. But this is not known and it is a topic for our future research.
Detailed record
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.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English