Positive definite completion problems for Bayesian networks (Q2910972)
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: Positive definite completion problems for Bayesian networks |
scientific article; zbMATH DE number 6081316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Positive definite completion problems for Bayesian networks |
scientific article; zbMATH DE number 6081316 |
Statements
12 September 2012
0 references
directed acyclic graph
0 references
partial matrices
0 references
positive definite matrices
0 references
positive definite completion
0 references
Cholesky decomposition
0 references
perfect graphs
0 references
decomposable graphs
0 references
inverse-covariance matrices
0 references
Bayesian networks
0 references
inverses
0 references
determinants
0 references
0.85896987
0 references
0.85797596
0 references
0.8552601
0 references
0.85326904
0 references
Positive definite completion problems for Bayesian networks (English)
0 references
