Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 974063, 17 pages
http://dx.doi.org/10.1155/2012/974063
Research Article

A Decomposition Algorithm for Learning Bayesian Networks Based on Scoring Function

Department of Mathematics, Xidian University, Xi'an 710071, China

Received 14 May 2012; Revised 12 August 2012; Accepted 28 August 2012

Academic Editor: B. V. Rathish Kumar

Copyright © 2012 Mingmin Zhu and Sanyang Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Bouchaala, A. Masmoudi, F. Gargouri, and A. Rebai, “Improving algorithms for structure learning in Bayesian Networks using a new implicit score,” Expert Systems with Applications, vol. 37, no. 7, pp. 5470–5475, 2010. View at Publisher · View at Google Scholar · View at Scopus
  2. A. Aussem and S. Rodrigues de Morais, “A conservative feature subset selection algorithm with missing data,” Neurocomputing, vol. 73, no. 4–6, pp. 585–590, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. S. R. de Morais and A. Aussem, “A novel Markov boundary based feature subset selection algorithm,” Neurocomputing, vol. 73, no. 4–6, pp. 578–584, 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. Y. Sun, Y. Tang, S. Ding, S. Lv, and Y. Cui, “Diagnose the mild cognitive impairment by constructing Bayesian network with missing data,” Expert Systems with Applications, vol. 38, no. 1, pp. 442–449, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. V. Aquaro, M. Bardoscia, R. Bellotti, A. Consiglio, F. De Carlo, and G. Ferri, “A Bayesian Networks approach to Operational Risk,” Physica A, vol. 389, no. 8, pp. 1721–1728, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Z. Ji, H. X. Zhang, R. B. Hu, and C. N. Liu, “Bayesian Network learning algorithm based on independence test and ant colony optimization,” Acta Automatica Sinica, vol. 35, no. 3, pp. 281–288, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. Z. Geng, C. Wang, and Q. Zhao, “Decomposition of search for v-structures in DAGs,” Journal of Multivariate Analysis, vol. 96, no. 2, pp. 282–294, 2005. View at Publisher · View at Google Scholar
  8. X. Xie and Z. Geng, “A recursive method for structural learning of directed acyclic graphs,” Journal of Machine Learning Research, vol. 9, pp. 459–483, 2008. View at Google Scholar · View at Zentralblatt MATH
  9. J. Cheng, R. Greiner, J. Kelly, D. Bell, and W. Liu, “Learning Bayesian networks from data: an information-theory based approach,” Artificial Intelligence, vol. 137, no. 1-2, pp. 43–90, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. J.-P. Pellet and A. Elisseeff, “Using Markov blankets for causal structure learning,” Journal of Machine Learning Research, vol. 9, pp. 1295–1342, 2008. View at Google Scholar · View at Zentralblatt MATH
  11. C. Borgelt, “A conditional independence algorithm for learning undirected graphical models,” Journal of Computer and System Sciences, vol. 76, no. 1, pp. 21–33, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. E. Perrier, S. Imoto, and S. Miyano, “Finding optimal Bayesian network given a super-structure,” Journal of Machine Learning Research, vol. 9, pp. 2251–2286, 2008. View at Google Scholar · View at Zentralblatt MATH
  13. L. M. de Campos, “A scoring function for learning Bayesian networks based on mutual information and conditional independence tests,” Journal of Machine Learning Research, vol. 7, pp. 2149–2187, 2006. View at Google Scholar · View at Zentralblatt MATH
  14. N. Friedman, I. Nachmama, and D. Peér, “Learning bayesian network structure from massive datasets: the “Sparse Candidate” algorithm,” in Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, pp. 206–215, Stockholm, Sweden, 1999.
  15. G. Cooper and E. Hersovits, “A bayesian method for the induction of probabilistic networks from data,” Machine Learning, vol. 9, pp. 309–347, 1992. View at Google Scholar
  16. R. W. Robinson, “Counting unlabeled acyclic digraphs,” Combinational Mathematics, vol. 622, pp. 28–43, 1977. View at Google Scholar
  17. K. Olesen and A. Madsen, “Maximal prime sub-graph decomposition of Bayesian networks,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 32, pp. 21–31, 2002. View at Google Scholar
  18. S. L. Lauritzen and D. J. Spiegelhalter, “Local computations with probabilities on graphical structures and their application to expert systems,” Journal of the Royal Statistical Society B, vol. 50, no. 2, pp. 157–224, 1988, With discussion. View at Google Scholar · View at Zentralblatt MATH
  19. X. C. Xie, Z. Geng, and Q. Zhao, “Decomposition of structural learning about directed acyclic graphs,” Artificial Intelligence, vol. 170, no. 4-5, pp. 422–439, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. D. J. Rose, R. E. Tarjan, and G. S. Lueker, “Algorithmic aspects of vertex elimination on graphs,” SIAM Journal on Computing, vol. 5, no. 2, pp. 266–283, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. R. E. Tarjan and M. Yannakakis, “Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs,” SIAM Journal on Computing, vol. 13, no. 3, pp. 566–579, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. I. Tsamardinos, L. E. Brown, and C. F. Aliferis, “The max-min hill-climbing Bayesian network structure learning algorithm,” Machine Learning, vol. 65, no. 1, pp. 31–78, 2006. View at Publisher · View at Google Scholar · View at Scopus
  23. R. E. Neapolitan, Learning Bayesian Networks, Prentice-Hall, Englewood Cliffs, NJ, USA, 2004.
  24. I. Beinlich, G. Suermondt, R. Chavez, and G. Cooper, “The ALARM Monitoring System: a case study with two probabilistic inference techniques for belief networks,” in Proceedings of the 2nd European Conference Artificial Intelligence in Medicine, 1989.
  25. J. Binder, D. Koller, S. Russell, and K. Kanazawa, “Adaptive Probabilistic Networks with Hidden Variables,” Machine Learning, vol. 29, no. 2-3, pp. 213–244, 1997. View at Google Scholar · View at Scopus
  26. K. Murphy, “The Bayes net toolbox for Matlab,” Computing Science and Statistics, vol. 33, pp. 331–350, 2001. View at Google Scholar
  27. C. F. Aliferis, A. R. Statnikov, I. Tsamardinos, and L. E. Brown, “Causal explorer: a causal probabilistic network learning toolkit for biomedical discovery,” in Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS'03), pp. 371–376, June 2003. View at Scopus
  28. R. Yehezkel and B. Lerner, “Bayesian network structure learning by recursive autonomy identification,” Journal of Machine Learning Research, vol. 10, pp. 1527–1570, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  29. S. L. Lauritzen, Graphical Models, vol. 17, Clarendon Press, New York, NY, USA, 1996.