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
Viterbi algorithmsum-product algorithmbelief propagationfactor graphsfast Fourier transform algorithmsturbo decoding algorithmforward/backward algorithm
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)
- 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
- 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
- On the convergence of kikuchi's natural iteration method
- A generalized gamma mixture model for ultrasonic tissue characterization
- Cortical Circuitry Implementing Graphical Models
- Access point selection in heterogeneous wireless networks using belief propagation
- Ensemble clustering using factor graph
- Parallel probabilistic graphical model approach for nonparametric Bayesian inference
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- \textsc{Friet}: an authenticated encryption scheme with built-in fault detection
- MAP inference via \(\ell_2\)-sphere linear program reformulation
- Statistical mechanics of the fashion game on random networks
- Bayesian Inference in Cumulative Distribution Fields
- Graph-based slice-to-volume deformable registration
- Monotonic optimization based decoding for linear codes
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- On the Uniqueness of Loopy Belief Propagation Fixed Points
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- Distribution of statistics of hidden state sequences through the sum-product algorithm
- A novel probabilistic clustering model for heterogeneous networks
- Convergence of a belief propagation algorithm for biological networks
- A biclustering approach based on factor graphs and the max-sum algorithm
- Study of the variable growth hypernetworks influence on the scaling law
- Characterizations of pseudo-codewords of (low-density) parity-check codes
- Joint source-decoding in large scale sensor networks using Markov random field models
- On learning conditional random fields for stereo
- Tomographic reconstruction from a small number of projections by an efficient sum-product reasoning method
- Random subcubes as a toy model for constraint satisfaction problems
- Lifted graphical models: a survey
- Graphical models for statistical inference and data assimilation
- Convex combination belief propagation
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- 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
- Convergence Theorems of Estimation of Distribution Algorithms
- Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation
- 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
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)