Skip to main content

A New BN Structure Learning Mechanism Based on Decomposability of Scoring Functions

  • Conference paper
  • First Online:
Bio-Inspired Computing -- Theories and Applications (BIC-TA 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 562))

Included in the following conference series:

Abstract

Bayesian networks are a powerful approach for representing and reasoning under conditions of uncertainty. Many researchers aim to find good algorithms for learning Bayesian networks from data. And the bio-inspired search algorithm is one of the most effective algorithms. We proposed a hybrid algorithm called MIC-BPSO (Maximal Information Coefficient – Binary Particle Swarm Optimization). This algorithm firstly applies network construction method based on Maximal Information Coefficient to improve the quality of initial particles, and then uses the decomposability of scoring function to modify BPSO algorithm. Experiment results show that, without a given node ordering, this algorithm outperforms MI-BPSO, I-BN-PSO, MWST-HC and K2 algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Larranaga, P., Karshenas, H., Bielza, C., Santana, R.: A review on evolutionary algorithms in Bayesian network learning and inference tasks. Inf. Sci. 233, 109–125 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wu, Y., McCall, J., Corne, D.: Two novel Ant Colony Optimization approaches for Bayesian network structure learning. In: IEEE Congress on Evolutionary Computation, pp. 1–7 (2010)

    Google Scholar 

  3. Pinto, P.C., Nagele, A., Dejori, M., Runkler, T.A., Sousa, J.: Using a local discovery ant algorithm for bayesian network structure learning. IEEE Trans. Evol. Comput. 13(4), 767–779 (2009)

    Article  Google Scholar 

  4. Li, G., Gao, X., Di, R.: DBN structure learning based on MI-BPSO algorithm. In: Proceedings of 13th IEEE/ACIS International Conference on Computer and Information Science, pp. 245–250 (2014)

    Google Scholar 

  5. Ji, J., Hu, R., Zhang, H., Liu, C.: A hybrid method for learning bayesian networks based on ant colony optimization. Appl. Soft Comput. 11, 3373–3384 (2011)

    Article  Google Scholar 

  6. Hu, R.: The Research on Structure Learning of Dynamic Bayesian Network. Beijing University of technology, Beijing (2009)

    Google Scholar 

  7. Barriere, O., Lutton, E., Wuillemin, P.H.: Bayesian network structure learning using cooperative coevolution. In: 11th Annual Conference on Genetic and Evolutionary Computation, pp. 755–762 (2009)

    Google Scholar 

  8. Cowie, J., Oteniya, L., Coles, R.: Particle Swarm Optimization for learning Bayesian Networks. Technical Report (2007)

    Google Scholar 

  9. Tonda, A., Lutton, E., Squillero, G., Wuillemin, P.-H.: A memetic approach to bayesian network structure learning. In: Esparcia-Alcázar, A.I. (ed.) EvoApplications 2013. LNCS, vol. 7835, pp. 102–111. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  10. Ji, J., Hu, R., Zhang, H., Liu, C.: An artificial bee colony algorithm for learning Bayesian networks. Soft. Comput. 17, 983–994 (2013)

    Article  Google Scholar 

  11. Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: Proceedings of the World Multi-conference on Systemics, Cybernetics and Informatics, pp. 4104–4109 (1997)

    Google Scholar 

  12. Lee, C., Chaotang, T., Pin, L.: A discrete version of particle swarm optimization for flowshop scheduling problems. Comput. Oper. Res. 34, 3099–3111 (2007)

    Article  Google Scholar 

  13. Kennedy, J., Eberhart, R., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  14. Guo, Q., Yu, H., Xu, A.: A hybrid PSO-GD based intelligent method for machine diagnosis. Digit. Sig. Proc. 16(4), 402–418 (2006)

    Article  Google Scholar 

  15. Zhang, Y., Zhang, W.: A novel Bayesian network structure learning algorithm based on maximal information coefficient. In: Proceedings of the Fifth International Conference on Advanced Computational Intelligence, pp. 862–867 (2012)

    Google Scholar 

  16. Zhang, Y., Zhang, W., Xie, Y.: Improved heuristic equivalent search algorithm based on maximal information coefficient for Bayesian network structure learning. Neurocomputing 117, 186–195 (2013)

    Article  Google Scholar 

  17. Reshef, D.N.: Detecting novel associations in large data sets. Science 334(6062), 1518–1524 (2011)

    Article  MATH  Google Scholar 

  18. Wei, B., Peng, Q., Zhao, J., Chen, X.: A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior. Eur. J. Oper. Res. 219, 224–233 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  19. Cooper, G., Herskovits, E.: A Bayesian method for the induction of probabilistic networks from data. Mach. Learn. 9(4), 309–347 (1992)

    MATH  Google Scholar 

  20. Brouard, T., Delaplace, A., Cardot, H.: Evolutionary methods for learning bayesian network structures. In: Advances in Evolutionary Algorithms, pp. 335–360 (2008)

    Google Scholar 

  21. Patrick, E., Kevin, K., Frederic, L.: Information-theoretic inference of large transcriptional regulatory networks. EURASIP J. Bioinform. Syst. Biol. 2007, 8 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lining Xing .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, G., Xing, L., Chen, Y. (2015). A New BN Structure Learning Mechanism Based on Decomposability of Scoring Functions. In: Gong, M., Linqiang, P., Tao, S., Tang, K., Zhang, X. (eds) Bio-Inspired Computing -- Theories and Applications. BIC-TA 2015. Communications in Computer and Information Science, vol 562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49014-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49014-3_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49013-6

  • Online ISBN: 978-3-662-49014-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics