Discovering a junction tree behind a Markov network by a greedy algorithm (Q402234)
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: Discovering a junction tree behind a Markov network by a greedy algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discovering a junction tree behind a Markov network by a greedy algorithm |
scientific article |
Statements
Discovering a junction tree behind a Markov network by a greedy algorithm (English)
0 references
27 August 2014
0 references
greedy algorithm
0 references
conditional independence
0 references
Markov network
0 references
triangulated graph
0 references
graphical models
0 references
Cherry tree probability distribution
0 references
contingency table
0 references
0 references
0 references
0 references
0.8000450730323792
0 references
0.7445014119148254
0 references
0.7334891557693481
0 references
0.7329396605491638
0 references
0.7316260933876038
0 references
