{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:31:57Z","timestamp":1777537917900,"version":"3.51.4"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/tsp.2012.2195656","type":"journal-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T20:57:59Z","timestamp":1341953879000},"page":"4135-4150","source":"Crossref","is-referenced-by-count":13,"title":["Feedback Message Passing for Inference in Gaussian Graphical Models"],"prefix":"10.1109","volume":"60","author":[{"given":"Ying","family":"Liu","sequence":"first","affiliation":[]},{"given":"Venkat","family":"Chandrasekaran","sequence":"additional","affiliation":[]},{"given":"Animashree","family":"Anandkumar","sequence":"additional","affiliation":[]},{"given":"Alan S.","family":"Willsky","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","author":"horn","year":"1990","journal-title":"Matrix Analysis"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-1345-z"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.10.006"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3149.3159"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.007"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553436"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/088342304000000026"},{"key":"ref11","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","author":"murphy","year":"1999","journal-title":"Proc Uncertainty Art Intell"},{"key":"ref12","article-title":"Loopy belief propagation as a basis for communication in sensor networks","volume":"18","author":"crick","year":"2003","journal-title":"Uncertainty Art Intell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/49.661103"},{"key":"ref14","first-page":"905","article-title":"Loopy belief propagation: Convergence and effects of message errors","volume":"6","author":"ihler","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/089976601750541769"},{"key":"ref16","first-page":"493","article-title":"Loopy belief propagation and Gibbs measures","volume":"18","author":"tatikonda","year":"2002","journal-title":"Uncertainty Art Intell"},{"key":"ref17","first-page":"2031","article-title":"Walk-sums and belief propagation in Gaussian graphical models","volume":"7","author":"malioutov","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.912280"},{"key":"ref19","article-title":"A constraint propagation approach to probabilistic reasoning","author":"pearl","year":"1986","journal-title":"Conf Uncertainty in Art Intel"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196305124"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/3468.541341"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796305109"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl391"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910581"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0208051"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.physd.2006.09.040"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1086\/173015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881"},{"key":"ref2","author":"sonka","year":"1999","journal-title":"Image Processing Analysis and Machine Vision"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti469"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513321"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00069-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176349846"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","author":"lauritzen","year":"1996","journal-title":"Graphical Models"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref23","author":"vazirani","year":"2004","journal-title":"Approximation Algorithms"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","article-title":"On the maximal number of disjoint circuits of a graph","volume":"9","author":"erds","year":"1962","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9152-0"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/6236322\/06194363.pdf?arnumber=6194363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T17:55:25Z","timestamp":1714154125000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6194363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":37,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2012.2195656","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}