Accuracy of loopy belief propagation in Gaussian models
From MaRDI portal
Publication:280330
DOI10.1016/J.NEUNET.2009.01.003zbMATH Open1403.62102DBLPjournals/nn/NishiyamaW09OpenAlexW2056215320WikidataQ47615071 ScholiaQ47615071MaRDI QIDQ280330FDOQ280330
Publication date: 10 May 2016
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2009.01.003
Applications of graph theory (05C90) Estimation in multivariate analysis (62H12) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Singularities in mixture models and upper bounds of stochastic complexity.
- Good error-correcting codes based on very sparse matrices
- Correctness of belief propagation in Gaussian graphical models of arbitrary topology
- Title not available (Why is that?)
- Information Geometry of Turbo and Low-Density Parity-Check Codes
- Statistical-mechanical approach to image processing
- Embedded Trees: Estimation of Gaussian Processes on Graphs with Cycles
- A CDMA multiuser detection algorithm on the basis of belief propagation
Cited In (2)
This page was built for publication: Accuracy of loopy belief propagation in Gaussian models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280330)