Open Access Open Access  Restricted Access Subscription or Fee Access

Implementation of Belief Propagation Iterative Method on Markov Chains by Designing Bayesian Networks

G. Padma, C. Vijayalakshmi

Abstract


This paper mainly deals with the analysis of belief propagation iterative method on Bayesian network in terms of Gaussian random variable. This paper designs a duality between graph structures and probability models in terms of belief propagation. A graphical model is designed to represent the probabilistic relationships between random variables. The variables are represented by nodes and the [1] conditional independencies or dependencies are represented by edges. Undirected edges give the correlation between variables which is defined as Markov random field. Directed edges give Casuality relationships between variables defined as Bayesian networks. Graphical models provide a natural tool for dealing with two problems such as uncertainty and complexity that occur throughout applied mathematics and engineering. Many of the classical, multivariate probabilistic systems studied in the fields of statistics, systems engineering, information theory, pattern recognition and statistical mechanics are special cases of the general graphical model formalism. An algorithm is designed for Gaussian belief propagation and the solution for the system of linear equations is obtained. Based on the network this algorithm runs and the convergence is obtained in comparison with other methods.

Keywords


Belief Propagation, Bayesian Networks, Markov Random Fields, Marginal Probability, Joint Probability

Full Text:

PDF

References


Padhraic Smyth, “Belief networks hidden markov models and markov random fields a unifying view”, 1998.

Y. Wang, T. Tan and K.F.Loe, “Video segmentation based on graphical models”, IEEE CVPR 2003, pp. 335342.

Zoubin Ghahramani, “Learning dynamic Bayesian networks”, October 1997.

J.H. Kim and J. Peal, “A computation model for casual and diagnostte reasoning in inference systems”, In proceedings of the 8th International Joint Conference on Artificial Intelligence, pages 190193, 1983.

J. Pearl, “Probabilistic reasoning in intelligence systems: Networks of plausible inference”, Morgan Kaufmann, San Mateo, CA, 1988.

P.H. Tan and L.K. Rasmussen, “Linear inference cancellation in CDMA based on xxxx techniques for linear equation systems”, IEEE Trans. Commu., Vol. 48, No. 12, pp. 20992108, Dec. 2000.

D. Bickson, D. Doler and Y. Weiss, “Modified belief propagation for energy saving in wireless sensor networks,” in Leibniz Center TR-2005-85, School of Computer Science and Engineering, The Hebrew University, 2005.

A. Yener, R.D. Yates and S. Ulukus, “CDMA multiuser detection: A non-linear programming approach”, IEEE Trans. Commun, Vol. 50, No. 6, p.p. 10161024, Jun. 2002.

D. Bickson, O. Shental, P. H. Siegel, J. K. Wolf, and D. Dolev, “Gaussian belief propagation based multiuser detection,” in IEEE Int. Symp. on InformTheory,p.p 18631867 .

O. Shental, D. Bickson, P. H. Siegel, J. K. Wolf, and D. Dolev, “A message-passing solver for linear systems” in Information Theory and Applications (ITA) Workshop,San Diego, CA, USA,January, 2008, p.p360-365.

Distributed Kalman Filter via Gaussian Belief Propagation, Danny Bickson, Ori Shental,Danny Dolev in Proc.46 th Allerton Conf.on Communications, Control and computing, Monticello, IL, USA, Sept. 2008,p.p 628635.

Digital Video Broadcasting (DVB), Interaction channel for Satellite Distribution Systems,ETSI EN 301790V1.5.1, May 2009.

Turbo Decoding as an Instance of Pearl‟s “Belief Propagation” Algorithm, Robert J. McEliece, David J. C.MacKay,and Jung-Fu Cheng in IEEE journal on selected areas in communications, vol. 16, no. 2, February 1998.

Mohsen Bayati, Margot Gerritsen, David Gleich, Amin Saberi, Ying Wang. Algorithms for Large, Sparse Network Alignment Problems. In Proceedings of ICDM'2009. pp.705-710.

G. Chechik, A. Globerson, N. Tishby, and Y. Weiss, “Informationbottleneck for gaussian variables,” in Journal of MachineLearning Research, vol. 6. Cambridge, MA, USA: MIT Press,2005, p.p. 165–188.

F. Kschischang, B. Frey, and H. A. Loeliger, “Factor graphsand the sum-product algorithm,” in IEEE Transactions onInformation Theory, vol. 47, Feb. 2001, pp. 498–519.

G. Padma and C. Vijayalakshmi ,A Probabilistic-Graphical approach for Errorcorrection in nanoscale Memory cells, In the proceedings of the national Conference at Sathyabama University,Chennai, pp 717-721.

Yedidia, J.S., Freeman, W.T. and Weiss, Y., 2005, Constructing free-energy approximations and generalized belief-propagation algorithms, IEEE Trans. Inform. Theory 51, 22822312.

G. Padma and C. Vijayalakshmi ,Implementation of Belief networks on Markov Random fields, In the proceedings of the International Conference at Institute of Management technology, serial no 47.

Probabilistic image processing and Bayesian network Kazuyuki Tanaka, Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan.

„Applications of Belief Propagation in CSMA Wireless Networks‟, Cai Hong Kai, Soung Chang Liew, archieves of Journal of Computing Research Repositor, July ,2010.

Belief Propagation Algorithm for Portfolio Optimization Problems, Takashi Shinzato and Muneki Yasuda in EconoPhysics Forum,August 2010


Refbacks

  • There are currently no refbacks.