Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation (Q4600562)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6824676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation |
scientific article; zbMATH DE number 6824676 |
Statements
Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation (English)
0 references
11 January 2018
0 references
Bayesian network
0 references
graphical model
0 references
minimal triangulation
0 references
maximal prime decomposition
0 references
0.89660525
0 references
0.84985954
0 references
0.8140258
0 references
0.81218123
0 references
0.81072795
0 references
0.8105949
0 references
0.7941166
0 references
