Factor graphs and the sum-product algorithm

DOI10.1109/18.910572zbMATH Open0998.68234DBLPjournals/tit/KschischangFL01OpenAlexW2137813581WikidataQ56698904 ScholiaQ56698904MaRDI QIDQ4544503FDOQ4544503

Authors: Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger 

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/08c370eb9ba13bfb836349e7f3ea428be4697818

Recommendations

• The generalized distributive law
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• The sum-product algorithm: algebraic independence and computational aspects
• scientific article; zbMATH DE number 2064647
• An introduction to variational methods for graphical models

zbMATH Keywords

Viterbi algorithmsum-product algorithmbelief propagationfactor graphsfast Fourier transform algorithmsturbo decoding algorithmforward/backward algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Cited In (only showing first 100 items - show all)

• Probabilistic graphical models and Markov networks
• Accelerated training of max-margin Markov networks with kernels
• Spatio-temporal random fields: compressible representation and distributed estimation
• Next nearest neighbour Ising models on random graphs
• Predecessor existence problems for finite discrete dynamical systems
• Codes on graphs: Recent progress
• Fast density-weighted low-rank approximation spectral clustering
• A complementary construction using mutually unbiased bases
• LDPC code design for nonuniform power-line channels
• Positioning based on factor graphs
• Event detection using ``variable module graphs for home care applications
• Probabilistic modelling, inference and learning using logical theories
• Low-complexity Gaussian detection for MIMO systems
• Bounded approximate decentralised coordination via the max-sum algorithm
• Loop series for discrete statistical models on graphs
• Markov network based ontology matching
• Tropical geometry of statistical models
• Flexibly regularized mixture models and application to image segmentation
• Non parametric distributed inference in sensor networks using box particles messages
• A Framework for Solving Hybrid Influence Diagrams Containing Deterministic Conditional Distributions
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• Optimal 2-constraint satisfaction via sum-product algorithms
• Recursive sum-product algorithm for generalized outer-planar graphs
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Tree-based reparameterization framework for analysis of sum-product and related algorithms
• Parametric inference for biological sequence analysis
• Hierarchical semi-Markov conditional random fields for deep recursive sequential data
• Investigation of commuting Hamiltonian in quantum Markov network
• Bayesian pedigree inference with small numbers of single nucleotide polymorphisms via a factor-graph representation
• Spike-Based Probabilistic Inference in Analog Graphical Models Using Interspike-Interval Coding
• Matrix fraction descriptions in convolutional coding
• Region graph partition function expansion and approximate free energy landscapes: theory and some numerical results
• Reward-modulated Hebbian learning of decision making
• Parallel finite element technique using Gaussian belief propagation
• Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
• Low-temperature excitations within the Bethe approximation
• TSFC: A Structure-Preserving Form Compiler
• Probabilistic reasoning in a classical logic
• Graphical models for optimal power flow
• Implied distributions in multiple change point problems
• Joint estimation of multiple related biological networks
• Gamma-based clustering via ordered means with application to gene-expression analysis
• Multicuts and perturb \& MAP for probabilistic graph clustering
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• A factor graph based genetic algorithm
• The asymptotics of the clustering transition for random constraint satisfaction problems
• Latent binary MRF for online reconstruction of large scale systems
• A probabilistic graphical model approach to stochastic multiscale partial differential equations
• Efficient and robust associative memory from a generalized Bloom filter
• Rigorous inequalities between length and time scales in glassy systems
• Belief Propagation in Networks of Spiking Neurons
• Convergence theorems of estimation of distribution algorithms
• Fast fitness improvements in estimation of distribution algorithms using belief propagation
• Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis
• Data association based on optimization in graphical models with application to sensor networks
• On the freezing of variables in random constraint satisfaction problems
• Explorative anytime local search for distributed constraint optimization
• Square root SAM: simultaneous localization and mapping via square root information smoothing
• Minimal contagious sets in random regular graphs
• Biased landscapes for random constraint satisfaction problems
• Graphical models
• Message-passing algorithms for inference and optimization
• The number of matchings in random graphs
• Title not available (Why is that?)
• On the dynamics of the glass transition on Bethe lattices
• Quantum graphical models and belief propagation
• A new distributed approximation algorithm for the maximum weight independent set problem
• A Message-Passing Approach to Phase Retrieval of Sparse Signals
• Introduction: Combining probability and logic
• The generalized distributive law
• Dynamic Bayesian networks for formal verification of structured stochastic processes
• Local and global approaches of affinity propagation clustering for large scale data
• Title not available (Why is that?)
• A library for formalization of linear error-correcting codes
• The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
• Robustifying sum-product networks
• An explicit method to generate some QC LDPC codes with girth 8
• Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
• Learning representations from dendrograms
• Unsupervised representation learning with minimax distance measures
• Transfer affinity propagation-based clustering
• A review of message passing algorithms in estimation of distribution algorithms
• Title not available (Why is that?)
• Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory
• Convergence and correctness of belief propagation for the Chinese postman problem
• Knowledge graphs completion via probabilistic reasoning
• Graphs for margins of Bayesian networks
• Understanding the scalability of Bayesian network inference using clique tree growth curves
• Bit-optimal decoding of codes whose Tanner graphs are trees
• Model-based machine learning
• Geometric Constructions of Gallager Codes
• On a hypergraph probabilistic graphical model
• Computation of cross-moments using message passing over factor graphs
• A local algorithm and its percolation analysis of bipartite z-matching problem
• On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes
• On the survey-propagation equations in random constraint satisfiability problems
• A Binary Variable Model for Affinity Propagation
• Relaxed maximum a posteriori fault identification
• Title not available (Why is that?)
• Operator growth bounds from graph theory

This page was built for publication: Factor graphs and the sum-product algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544503)