By Topic

Gaussian inference in loopy graphical models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Plarre, K. ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA ; Kumar, P.R.

We show precisely that message passing for inference in Gaussian graphical models on singly connected graphs is just a distributed implementation of Gaussian elimination without any need for backsubstitution. This observation allows us to generalize the procedure to arbitrary loopy Gaussian graphical models. We thus construct a message passing algorithm that is guaranteed to converge in finite time, and solve the inference problem exactly. The complexity of this algorithm grows gradually with the "distance" of the graph to a tree. This algorithm can be implemented in a distributed environment as, for example, in sensor networks.

Published in:

Decision and Control, 2003. Proceedings. 42nd IEEE Conference on  (Volume:6 )

Date of Conference:

9-12 Dec. 2003