Skip to main content
SpringerLink
Log in

Belief propagation algorithms for finding the probable configurations over factor graph models

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

In this article, we study the belief propagation algorithms for solving the multiple probable configurations (MPC) problem over graphical models. Based on the loopy max-product methodology, we first develop an iterative belief propagation mechanism (IBPM), which aims to find the most probable configurations facing with the existence of multiple solutions. In applications ranging from low-density parity-check codes to combinatorial optimization one would like to find not just the best configurations but rather than the summary of all possible explanations. Not only can this problem be solved by our proposed loopy message-passing algorithm (LMPA), we also prove that, for tree factor graph models, this LMPA guarantees fast convergence. Moveover, we subsequently present a low-complexity approach to simplifying the message integration operation throughout the whole belief propagation circulation. Simulations built on various settings demonstrate that both IBPM and LMPA can accurately and rapidly approximate the MPC in acyclic graph with hundreds of variables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Xie Z, Gao J, Wu X (2009) Regional category parsing in undirected graphical models. Pattern Recognit Lett 30(14):1264–1272

    Article  Google Scholar 

  2. Kschischang FR, Frey BJ, Loeliger H (2001) Factor graphs and the sum-product algorithm. IEEE Trans Inf Theory 47(2):498–519

    Article  MATH  MathSciNet  Google Scholar 

  3. Pearl J (1988) Probabilistic reasoning in intelligent system: networks of plausible inference. Morgan Kaufmann. pp 145–567

  4. Chiu S-C, Huang J-L, Huang J-H (2009) On processing continuous frequent K-N-match queries for dynamic data over networked data sources. Knowl Inf Syst 7:234–254

    Google Scholar 

  5. Zhang Y, Tang J, Sun J, Rao J (2010) Moodcast: emotion prediction via dynamic continuous factor graph model. In: ICDM’10, pp 1193–1198

  6. Bickson D, Dolev, Weiss D (2005) Modified belief propagation algorithm for energy saving in wireless and sensor networks. The Hebrew University of Jerusalem. Technical report, pp 346–362

  7. Le T, Hadjicostis CN (2008) Max-product algorithms for the generalized multiple fault diagnosis problem. IEEE Trans Syst Man Cybern B 37(6):1607–1621

    Google Scholar 

  8. Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 58(14):972–976

    Article  MathSciNet  Google Scholar 

  9. Yedidia J, Freeman W, Weiss Y (2003) Understanding belief propagation and its generalization. In: Lakemeyer G, Nebel B (eds) Exploring artificial intelligence in the New Millennium, Morgan Kaufmann. pp 675–786

  10. Weiss Y, Freeman WT (2001) On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Trans Inf Theory 47(2):723–735

    Article  MathSciNet  Google Scholar 

  11. Yanover C, Weiss Y (2006) Finding the M most probable configurations using loopy belief propagation. In: IEEE Infocom 2006, pp 453–467

  12. Nilsson D (1998) An efficient algorithm for finding the M most probable configurations in probabilistic expert systems. Stat Comput 8:159–173

    Article  MathSciNet  Google Scholar 

  13. Cercone N, An X, An A (2011) Finding best evidence-based best practice recommendations in health care: the initial decision support system design. Knowl Inf Syst 29(1):159–201

    Article  Google Scholar 

  14. Elliott PH (2007) Extracting the K best solutions from a valued And-Or acyclic graph. Master’s thesis, Massachusetts Institute of Technology, pp 245–269

  15. Dechter R, Flerova N (2011) Heuristic search for m best solutions with applications to graphical models. In: Proceedings of soft 2011, pp 145–167

  16. Fromer M, Globerson A (2009) An LP view of the M-best MAP problem. Adv Neural Inf Process Syst 22:567–575

    Google Scholar 

  17. Flerova N, Dechter R, Rollon E (2011) Bucket and mini-bucket schemes for m best solutions over graphical models. In: GKR’11 workshop, pp 256–278

  18. Xiong L, Wang F, Zhang C (2007) Multilevel belief propagation for fast inference on markov random fields. In: Proceedings of 7th IEEE international conference on data mining (ICDM), vol 28, no 31, pp 371–380

Download references

Acknowledgments

Mr. Ho Simon Wang, at HUST Academic Writing Center has provided tutorial assistance to improve the presentation of this paper.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China

    Zheng Wang & Yunsheng Liu

  2. School of Computer and Information Science, Hubei Engineering Univesity, Hubei, China

    Guangwei Wang

Authors
  1. Zheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunsheng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guangwei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zheng Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Z., Liu, Y. & Wang, G. Belief propagation algorithms for finding the probable configurations over factor graph models. Knowl Inf Syst 39, 265–285 (2014). https://doi.org/10.1007/s10115-013-0622-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-013-0622-1

Keywords

Search

Navigation