Sufficient Conditions for Convergence of the Sum–Product Algorithm (Q3549121)
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: Sufficient Conditions for Convergence of the Sum–Product Algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient Conditions for Convergence of the Sum–Product Algorithm |
scientific article |
Statements
Sufficient Conditions for Convergence of the Sum–Product Algorithm (English)
0 references
21 December 2008
0 references
Contraction
0 references
convergence
0 references
factor graphs
0 references
graphical models
0 references
loopy belief propagation
0 references
marginalization
0 references
message passing
0 references
sum-product algorithm
0 references
0.8461130857467651
0 references
0.8172978162765503
0 references
0.8172978162765503
0 references
0.8065056204795837
0 references
0.8065053224563599
0 references
