Skip to main content
Log in

BNC-VLA: bayesian network structure learning using a team of variable-action set learning automata

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Bayesian Network (BN) is a probabilistic graphical model which describes the joint probability distribution over a set of random variables. One of the most important challenges in the field of BNs is to find an optimal network structure based on an available training dataset. Since the problem of searching the optimal BN structure belongs to the class of NP-hard problems, typically greedy algorithms are used to solve it. In this paper a learning automata-based algorithm has been proposed to solve the BNs structure learning problem. There is a learning automaton corresponding with each random variable and at each stage of the proposed algorithm, named BNC-VLA, a set of learning automata is randomly activated and determined the graph edges that must be appeared in that stage. Finally, the constructed network is evaluated using a scoring function. As BNC-VLA algorithm proceeds, the learning process focuses on the BN structure with higher scores. The convergence of this algorithm is theoretically proved; and also some experiments are designed to evaluate the performance of it. Experimental results show that BNC-VLA is capable of finding the optimal structure of BN in an acceptable execution time; and comparing against other search-based methods, it outperforms them.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Larrañaga P, Poza M, Yurramendi Y, Murga RH, Kuijpers CMH (1996) Structure learning of Bayesian networks by genetic algorithms: A performance analysis of control parameters. IEEE Trans Pattern Anal Mach Intell 18(9):912–926

    Article  Google Scholar 

  2. Chickering DM, Geiger D, Heckerman D (1994) Learning Bayesian Network is NP-hard, Technical Report MSR-TR-94-14

  3. Cheng J, Bell DA, Liu W (1997) An algorithm for Bayesian belief network construction from data. In: proceedings of AI & STAT’97, pp 83–90

  4. Chow C, Liu C (1968) Approximating discrete probability distributions with dependence trees. IEEE Trans Inf Theory 14(3):462–467

    Article  MathSciNet  MATH  Google Scholar 

  5. Heckerman D, Geiger D, Chickering DM (1995) Learning Bayesian Networks: The Combination of Knowledge and Statistical Data, Technical Report MSR-TR-94-09

  6. De C, Cassio P, Ji Q (2011) Efficient structure learning of Bayesian networks using constraints. J Mach Learn Res 12:663–689

    MathSciNet  MATH  Google Scholar 

  7. Friedman N, Iftach N, Dana P (1999) Learning bayesian network structure from massive datasets: the sparse candidate algorithm. In: Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence. Morgan Kaufmann Publishers Inc., pp 206–215

  8. Larranaga P, Kuijpers CMH, Murga RH, Yurramendi Y (1996) Learning Bayesian Network Structures by Searching for the Best Ordering with Genetic Algorithms. IEEE Trans. Syst. Man Cybern. 26:487–493

    Article  Google Scholar 

  9. Myers JW, Laskey KB, Levitt TS (1999) Learning Bayesian Networks from Incomplete Data with Stochastic Search Algorithms, Proceeding of UAI Conference, 476–485

  10. Rezvani, Nabi A, Mohammad RM (2009) A Learning Automata-Based Technique for Training Bayesian Networks. In: International Conference on Advanced Computer Theory and Engineering (ICACTE 2009). ASME Press

  11. Moradabadi B, Beigy H (2014) A new real-coded Bayesian optimization algorithm based on a team of learning automata for continuous optimization. Genet Program Evolvable Mach 15(2):169–193

    Article  Google Scholar 

  12. Tsamardinos I, Brown LE, Aliferis CF (2006) The max-min hill-climbing Bayesian network structure learning algorithm. Mach Learn 65(1):31–78

    Article  Google Scholar 

  13. Yuan C, Malone B, Xiaojian W (2011) Learning optimal Bayesian networks using A* search. In: IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol 22, p 2186

  14. De C, Luis M, Fernandez-Luna JM, Gámez J A, Puerta J M (2002) Ant colony optimization for learning Bayesian networks. Int J Approx Reason 31(3):291–311

    Article  MathSciNet  MATH  Google Scholar 

  15. Hesar AS (2013) Structure Learning of Bayesian Belief Networks Using Simulated Annealing Algorithm. Middle-East J Sci Res 18(9):1343–1348

    Google Scholar 

  16. Murphy K (2001) An introduction to graphical models. Rap. tech

  17. Pelikan M, David EG (2002) Bayesian optimization algorithm: From single level to hierarchy. University of Illinois at Urbana-Champaign, Champaign, IL

  18. Gallagher M, Wood I, Keith J, Sofronov G (2007) Bayesian inference in estimation of distribution algorithms. In: Evolutionary Computation, 2007. CEC 2007. IEEE Congress on, pp. 127–133. IEEE

  19. Heckerman D (2008) A tutorial on learning with Bayesian networks. In: Innovations in Bayesian Networks. Springer, Berlin, pp 33–82

    Chapter  Google Scholar 

  20. Thathachar MAL, Harita BR (1987) Learning automata with changing number of actions. IEEE Trans Syst Man Cybern SMG17:1095–1100

    Article  Google Scholar 

  21. Narendra KS, Thathachar MAL (2012) Learning automata: an introduction. Courier Corporation

  22. Thathachar MAL, Sastry PS (1985) A Class of Rapidly Converging Algorithms for Learning Automata. IEEE Trans Syst Man Cybern SMC-15:168–175

    Article  MathSciNet  MATH  Google Scholar 

  23. Lakshmivarahan S, Thathachar MAL (1976) Bounds on the convergence probabilities of learning automata. IEEE Trans Syst Man Cybern SMC-6:756–763

    Article  MathSciNet  MATH  Google Scholar 

  24. Beigy H, Meybodi MR (2006) Utilizing distributed learning automata to solve stochastic shortest path problems. Int J Uncertainty Fuzziness Knowledge Based Syst 14:591–615

    Article  MathSciNet  MATH  Google Scholar 

  25. Beinlich IA, Suermondt HJ, Martin Chavez R, Cooper GF (1989) The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks . Springer, Berlin

    Google Scholar 

  26. Herskovits E (1991) Computer-based probabilistic-network construction, PhD diss., Stanford University

  27. Lauritzen SL, Spiegelhalter DJ (1988) Local computations with probabilities on graphical structures and their application to expert systems. J R Stat Soc Ser B Methodol:157–224

  28. Netica Netica Bayesian network software from Norsys. http://www.norsys.com

  29. Feng G, Zhang J-D, Liao SS (2014) A novel method for combining Bayesian networks, theoretical analysis, and its applications. Pattern Recogn 47(5):2057–2069

    Article  Google Scholar 

  30. Murphy PM, Aha DW (1995) UCI Repository of Machine Learning Databases, Available: http://www.ics.uci.edu/~mlearn/MLRepository.html

  31. Kohavi R, John G (1997) Wrappers for Feature Subset Selection, Elsevier Science. Artif Intell 97:273–324

    Article  MATH  Google Scholar 

  32. Pernkopf F (2005) Bayesian network classifiers versus selective k-NN classifier. Pattern Recogn 38(1):1–10

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Gheisari.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gheisari, S., Meybodi, M.R., Dehghan, M. et al. BNC-VLA: bayesian network structure learning using a team of variable-action set learning automata. Appl Intell 45, 135–151 (2016). https://doi.org/10.1007/s10489-015-0743-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-015-0743-1

Keywords

Navigation