Efficient designs for Bayesian networks with sub-tree bounds (Q518229)
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: Efficient designs for Bayesian networks with sub-tree bounds |
scientific article; zbMATH DE number 6697658
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient designs for Bayesian networks with sub-tree bounds |
scientific article; zbMATH DE number 6697658 |
Statements
Efficient designs for Bayesian networks with sub-tree bounds (English)
0 references
28 March 2017
0 references
information measure
0 references
Bayesian networks
0 references
upper and lower bounds
0 references
almond tree
0 references
junction tree algorithm
0 references
petroleum exploration
0 references
subset selection
0 references
design of experiment
0 references
0 references
