Earticle

초록

영어

Loopy Belief propagation is an increasingly popular method of performing approximate inference on arbitrary graphical models. Bayesian network is a graphical model that encodes probabilistic relationships among variables of interest. When used in conjunction with statistical techniques, the graphical model has several advantages for data mining. Influence diagrams provide a compact technique to represent problems of decision making especially multi-criteria decision making (MCDM) under uncertainty. As a number of nodes in the network increases, computing exact solutions and making optimal decision becomes computationally intractable. Approximate solution becomes more efficient in term of the performance of execution and the storage space. In particular, the belief propagation (or sum-product) algorithm has become a well-known means of solving inference problems approximately. Therefore, the loopy belief propagation is the alternative way for approximate solution and is presented in this paper. A solution is approximated where high-probability actions under the policy have a high utility. Actions are then selected which have a high probability under the approximating policy. The loopy belief propagation method is shown to compare favorably to exact methods.

목차

Abstract
 1. Introduction
 2. Background
 3. Bayesian Network and Influence Diagram
  3.1 Bayesian Network
  3.2 Influence Diagram
  3.3 Inference Algorithms
 4. Extended ID with Loopy Belief Propagation
 5. Experiments and Results
 6. Conclusion
 References

저자

• Wiboonsak Watthayu [ Department of Mathematics King Mongkut’s University of Technology Thonburi Bangkok, Thailand ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605