Towards fast and efficient algorithm for learning Bayesian network

Abstract

Learning Bayesian network structure is one of the most exciting challenges in machine learning. Discovering a correct skeleton of a directed acyclic graph(DAG) is the foundation for dependency analysis algorithms for this problem. Considering the unreliability of high order condition independence(CI) tests, and to improve the efficiency of a dependency… (More)
DOI: 10.1007/s11859-015-1084-y

Topics

5 Figures and Tables

Cite this paper

@article{Li2015TowardsFA, title={Towards fast and efficient algorithm for learning Bayesian network}, author={Yanying Li and YouLong Yang and Xiaofeng Zhu and Wenming Yang}, journal={Wuhan University Journal of Natural Sciences}, year={2015}, volume={20}, pages={214-220} }