Skip to main content
SpringerLink
Log in

A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures

  • Conference paper
Parallel Problem Solving from Nature - PPSN VIII (PPSN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3242))

Included in the following conference series:

Abstract

Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models from data, we have previously considered various evolutionary algorithms for searching the space of BN structures directly. In this paper, we explore a simple evolutionary algorithm designed to search the space of BN equivalence classes. We discuss a number of issues arising in this evolutionary context and provide a first assessment of the new class of algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Larrañaga, P., Poza, M., Yurramendi, Y., Murga, R., Kuijpers, C.H.: Structure learning of bayesian networks by genetic algorithms: A performance analysis of control parameters. IEEE Transactions on Pattern Analysis and Machine Intelligence 10, 912–926 (1996)

    Article  Google Scholar 

  2. Wong, M., Lam, W., Leung, K.: Using evolutionary programming and minimum description length principle for data mining of bayesian networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 21, 174–178 (1999)

    Article  Google Scholar 

  3. Cotta, C., Muruzábal, J.: Towards a more efficient evolutionary induction of bayesian networks. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 730–739. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Heckerman, D.: A tutorial on learning with bayesian networks. In: Jordan, M. (ed.) Learning in Graphical Models, pp. 301–354. Kluwer, Dordrecht (1998)

    Google Scholar 

  5. Andersson, S., Madigan, D., Perlman, M.: A characterization of markov equivalence classes for acyclic digraphs. Annals of Statistics 25, 505–541 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gillespie, S., Perlman, M.: Enumerating Markov equivalence classes of acyclic digraph models. In: Goldszmidt, M., Breese, J., Koller, D. (eds.) Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence, Seatle WA, pp. 171–177. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  7. Chickering, D.: Learning equivalence classes of Bayesian-network structures. Journal of Machine Learning Research 2, 445–498 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fogel, L., Owens, A., Walsh, M.: Artificial Intelligence Through Simulated Evolution. Wiley, New York (1966)

    MATH  Google Scholar 

  9. Heckerman, D., Geiger, D., Chickering, D.: Learning bayesian networks: the combination of knowledge and statistical data. Machine Learning 20, 197–243 (1995)

    MATH  Google Scholar 

  10. Acid, S., de Campos, L.M.: Searching for bayesian network structures in the space of restricted acyclic partially directed graphs. Journal of Artificial Intelligence Research 18, 445–490 (2003)

    MATH  MathSciNet  Google Scholar 

  11. Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  12. Beinlich, I., Suermondt, H., Chavez, R., Cooper, G.: The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks. In: Hunter, J., Cookson, J., Wyatt, J. (eds.) Proceedings of the Second European Conference on Artificial Intelligence and Medicine, pp. 247–256. Springer, Heidelberg (1989)

    Google Scholar 

  13. Kayaalp, M., Cooper, G.: A bayesian network scoring metric that is based on globally uniform parameter priors. In: Darwiche, A., Friedman, N. (eds.) Proceedings of the Eighteenth Annual Conference on Uncertainty in Artificial Intelligence, San Francisco, CA, Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  14. Castelo, R., Kočka, T.: On inclusion-driven learning of bayesian networks. Journal of Machine Learning Research 4, 527–574 (2003)

    Article  Google Scholar 

  15. Chickering, D.: Optimal structure identification with greedy search. Journal of Machine Learning Research 3, 507–554 (2002)

    Article  MathSciNet  Google Scholar 

  16. Nielsen, J., Kočka, T., Peña, J.: On local optima in learning bayesian networks. In: Rulff, U., Meek, C. (eds.) Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence, Acapulco, Mexico, pp. 435–442. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  17. Beyer, H.G.: Toward a theory of evolution strategies: Self adaptation. Evolutionary Computation 3, 311–347 (1996)

    Article  MathSciNet  Google Scholar 

  18. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics 39, 653–684 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grupo de Estadística y Ciencias de la Decisión, ESCET, University Rey Juan Carlos, 28933, Móstoles, Spain

    Jorge Muruzábal

  2. Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Carlos Cotta

Authors
  1. Jorge Muruzábal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos Cotta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Birmingham, Birmingham, UK

    Xin Yao

  2. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund K. Burke

  3. Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel de Lardizábal 1, 20018, San Sebastian, Donostia, Spain

    José A. Lozano

  4. University of the West of England, Bristol, United Kingdom

    Jim Smith

  5. GeNeura Team, Depto. Arquitectura y Tecnología de Computadores, Universidad de Granada, Spain

    Juan Julián Merelo-Guervós

  6. School of Computer Science, The University of Birmingham, B15 1TT, Edgbaston, Birmingham, UK

    John A. Bullinaria

  7. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, Great Britain

    Jonathan E. Rowe

  8. School of Computer Science, University of Birmingham, United Kingdom

    Peter Tiňo

  9. School of Computer Science, The University of Birmingham, B15 2TT, Birmingham, UK

    Ata Kabán

  10. Faculty of Computer Science, Dortmund University of Technology, 44221, Dortmund, Germany

    Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Muruzábal, J., Cotta, C. (2004). A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30217-9_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23092-2

  • Online ISBN: 978-3-540-30217-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation