Complexity statistical estimates of straightforward and greedy algorithms for algebraic Bayesian networks syntesis (Q4636099)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity statistical estimates of straightforward and greedy algorithms for algebraic Bayesian networks syntesis |
scientific article; zbMATH DE number 6863700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity statistical estimates of straightforward and greedy algorithms for algebraic Bayesian networks syntesis |
scientific article; zbMATH DE number 6863700 |
Statements
23 April 2018
0 references
uncertainty representation
0 references
algebraic Bayesian networks
0 references
probabilistic graphical models
0 references
knowledge pattern
0 references
knowledge with uncertainty
0 references
probabilistic-logic inference
0 references
statistical indicators for algorithm complexity
0 references
0.6962482929229736
0 references
0.6815957427024841
0 references
