Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (Q5229963)
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: Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited |
scientific article; zbMATH DE number 7095945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited |
scientific article; zbMATH DE number 7095945 |
Statements
Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (English)
0 references
19 August 2019
0 references
computational inference
0 references
marginalisation
0 references
message passing
0 references
mode evaluation
0 references
variational approximations
0 references
hidden Markov models
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.86805713
0 references
0.8560611
0 references
0.8478619
0 references
0.8396916
0 references
