Automatic Construction of Bayesian Network Structures by Means of a Concurrent Search Mechanism

  • R. Mondragón-Becerra
  • N. Cruz-Ramírez
  • A. García-López D.
  • K. Gutiérrez-Fragoso
  • A. Luna-Ramírez W.
  • G. Ortiz-Hernández
  • A. Piña-García C.
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4293)


The implicit knowledge in the databases can be extracted of automatic form. One of the several approaches considered for this problem is the construction of graphical models that represent the relations between the variables and regularities in the data. In this work the problem is addressed by means of an algorithm of search and scoring. These kind of algorithms use a heuristic mechanism search and a function of score to guide themselves towards the best possible solution.

The algorithm, which is implemented in the semifunctional language Lisp, is a searching mechanism of the structure of a bayesian network (BN) based on concurrent processes.

Each process is assigned to a node of the BN and effects one of three possible operations between its node and some of the rest: to put, to take away or to invert an edge. The structure is constructed using the metric MDL (made up of three terms), whose calculation is made of distributed way, in this form the search is guided by selecting those operations between the nodes that minimize the MDL of the network.

In this work are presented some results of the algorithm in terms of comparison of the structure of the obtained network with respect to its gold network.


Bayesian Network Direct Acyclic Graph Minimum Description Length Concurrent Process Coordinator Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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 (2003)Google Scholar
  2. 2.
    Ben-Ari, M.: Principles of Concurrent and Distributed Programming, Great Britain. Hoare, C.A.R. (series ed.) (1990)Google Scholar
  3. 3.
    Castillo, E.M., Gutiérrez, J.M., Hadi, A.S.: Sistemas Expertos y Modelos de Redes Probabilísticas. Academia Española de Ingeniería (1998),
  4. 4.
    Chen, R., Sivakumar, K., Kargupta, H.: Collective mining of bayesian networks from distributed heterogeneous data. In: Knowledge and Information Systems (2004)Google Scholar
  5. 5.
    Kohavi, R.: A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection. In: International Joint Conference on Artificial Intelligence (IJCAI), USA (1995)Google Scholar
  6. 6.
    Cruz-Ramírez, N.: Building Bayesian Networks from Data: a Constraint-based Approach. Ph.D. Thesis, Department of Psychology, Londres, The University of Sheffield (2001)Google Scholar
  7. 7.
    Grünwald, P.D.: In: Myung, J., Pitt, M.A. (consulted November 21, 2005),
  8. 8.
    Fikes, R.E., Nilsson, N.J.: STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. In: Artificial Intelligence 2, United States (1971)Google Scholar
  9. 9.
    Friedman, N., Goldszmidt, M.: Learning Bayesian networks with local structure. In: Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (1996)Google Scholar
  10. 10.
    Kaebling, L.P.: Learning in embedded systems. A Bradford Book / MIT Press, Cambridge (1993)Google Scholar
  11. 11.
    Krause, P.J.: Learning probabilistic networks. The Knowledge Engineering Review 13(4), 321–351 (1998)CrossRefGoogle Scholar
  12. 12.
    Lam, W., Segre, A.: A Distributed Learning Algorithm for Bayesian Inference Networks. In: IEEE Transactions on Knowledge and Data Engineering (2002)Google Scholar
  13. 13.
    McFarland, D.: Autonomy and Self-Sufficiency in Robots. In: Steels, L., Brooks, R. (eds.) The Artificial Route to Artificial Intelligence, Lawrence Erlbaum Associates, United States (1995)Google Scholar
  14. 14.
    Morales, E.: (consulted November 23, 2005),
  15. 15.
    Murphy, K.: (consulted November 23, 2005),
  16. 16.
    Newell, A.: The Knowledge Level, Technical report CMUCS-81-131, Carnegie Mellon University, United States (1991)Google Scholar
  17. 17.
    Nilsson, N.J.: Inteligencia Artificial. Una nueva síntesis. McGraw-Hill, España (2001)Google Scholar
  18. 18.
    Rissanen, J.: (2005, 11, 21),
  19. 19.
    Russell, S.J., Norvig, P.: Artificial Intelligence. A Modern Approach. Prentice-Hall, United States (1996)Google Scholar
  20. 20.
    Sivakumar, K., Chen, R., Kargupta, H.: Learning Bayesian Network Structure from Distributed Data. In: Proceedings of the 3rd SIAM International Data Mining Conference, San Franciso (2003)Google Scholar
  21. 21.
    Sucar, L.E., Pérez-Brito, J., Ruiz Suárez, J.C., Morales, E.: Learning Structure from Data and its Application to Ozone Prediction. Applied Intelligence 7(4), 327–338 (1997)CrossRefGoogle Scholar
  22. 22.
    Suzuki, J.: Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: Basic Properties. IEICE Trans. Fundamentals (1999)Google Scholar
  23. 23.
    Tannenbaum, A.S., Von Steen, M.: Distributed Systems. Principles and Paradigms. Prentice-Hall, USA (2002)Google Scholar
  24. 24.
    Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • R. Mondragón-Becerra
    • 1
  • N. Cruz-Ramírez
    • 1
  • A. García-López D.
    • 1
  • K. Gutiérrez-Fragoso
    • 1
  • A. Luna-Ramírez W.
    • 1
  • G. Ortiz-Hernández
    • 1
  • A. Piña-García C.
    • 1
  1. 1.Facultad de Física e Inteligencia Artificial, Departamento de Inteligencia ArtificialUniversidad VeracruzanaXalapa, Ver.México

Personalised recommendations