Skip to main content

Bayesian Optimization Algorithm Based on Incremental Model Building

  • Conference paper
  • First Online:
Computational Intelligence and Intelligent Systems (ISICA 2015)

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

  • 1699 Accesses

Abstract

In Bayesian Optimization Algorithm (BOA), to accurately build the best Bayesian network with respect to most metrics is NP-complete. This paper proposes an improved BOA based on incremental model building, which learns Bayesian network structure using PBIL instead of greedy algorithm in BOA. The PBIL is effective to learn better Bayesian network. The simulation results also show that the improved BOA has the better performance than BOA.

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. Pelikan, M., Sastry, K., Cantú-Paz, E.: Scalable Optimization Via Probabilistic Modeling: From Algorithms to Applications. Springer, Heidelberg (2006)

    Book  Google Scholar 

  2. Lozano, J.A., Larranaga, P., Inza, I., Bengoetxea, E.: Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms. Springer, Heidelberg (2006)

    Book  Google Scholar 

  3. Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 21(1), 5–20 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: BOA: the Bayesian optimization algorithm. In: Banzhaf, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, pp. 525–532. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  5. Pelikan, M.: Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms. Springer, Heidelberg (2005)

    Google Scholar 

  6. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988)

    Google Scholar 

  7. Pelikan, M., Goldberg, D.E., Sastry, K.: Bayesian optimization algorithm, decision graphs, and Occam’s razor. In: Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 519–529. Morgan Kaufmann: San Francisco, California (2001)

    Google Scholar 

  8. Chickering, D.M., Heckerman, D., Meek, C.: Large-sample learning of Bayesian networks is NP-hard. J. Mach. Learn. Res. 5, 1287–1330 (2004)

    MathSciNet  MATH  Google Scholar 

  9. Baluja, S.: Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical report no. CMU-CS-94-163, Carf Michigan, Ann Arbor (1994)

    Google Scholar 

  10. Lima, C.F., Lobo, F.G., Pelikan, M., Goldberg, D.E.: Model accuracy in the Bayesian optimization algorithm. Soft. Comput. 15, 1351–1371 (2011)

    Article  Google Scholar 

  11. Henrion, M.: Propagation of uncertainty in Bayesian networks by logic sampling. In: Lemmer, J.F., Kanal, L.N. (eds.) Uncertainty in Artificial Intelligence, pp. 149–163. Elsevier, Amsterdam (1988)

    Google Scholar 

  12. Fukuda, S., Yoshihiro, T.: Learning Bayesian networks using probability vectors. In: Omatu, S., Bersini, H., Corchado Rodríguez, J.M., González, S.R., Pawlewski, P., Bucciarelli, E. (eds.) Distributed Computing and Artificial Intelligence 11th International Conference. AISC, vol. 290, pp. 503–510. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  13. Goldberg, D.E.: Simple genetic algorithms and the minimal, deceptive problem (Chap. 6). In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 74–88. Morgan Kaufmann, Los Altos (1987)

    Google Scholar 

Download references

Acknowledgement

This work was partly supported by the Natural Science Foundation of Guangdong Province under Grant No. S2013040015755, the Foundation for Distinguished Young Talents in Higher Education of Guangdong Province under Grant No. 2013LYM_0119, and the Special Foundation for Public Welfare Research and Capacity Building of Guangdong Province under Grant No. 2014A020208087.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jintao Yao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Yao, J., Kong, Y., Yang, L. (2016). Bayesian Optimization Algorithm Based on Incremental Model Building. In: Li, K., Li, J., Liu, Y., Castiglione, A. (eds) Computational Intelligence and Intelligent Systems. ISICA 2015. Communications in Computer and Information Science, vol 575. Springer, Singapore. https://doi.org/10.1007/978-981-10-0356-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0356-1_20

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0355-4

  • Online ISBN: 978-981-10-0356-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics