Factor Graphs and the Sum-Product Algorithm

Kschischang, F. R., Frey, B. J., & Loeliger, H. -. (2001). Factor Graphs and the Sum-Product Algorithm. IEEE, 47(2), 498-519.

Type

Journal article

Intellectual base

Primary research

Year

2001

DOI

10.1109/18.910572

Link

https://doi.org/10.1109/18.910572

Cited by

3 citations across 3 artifacts.

Domain-specific

• Factor graph
  • … directly demonstrates that the global function, variable domains, local factors, factor scopes, graph edges, semiring or aggregation operators, and message-passing assumptions are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..
• Forward–Backward Algorithm
  • Kschischang, Frey, and Loeliger show how factor-graph message passing computes marginals of factored global functions, placing forward–backward inside a broader exact sum-product family on trees.
• Variational Message Passing
  • Sum-product messages combine local functions and incoming messages to compute marginals, exactly on appropriate acyclic factor graphs and approximately when used in loopy settings

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:29c29aaa978d · see in the full table