Journal
KNOWLEDGE-BASED SYSTEMS
Volume 121, Issue -, Pages 185-197Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2017.01.029
Keywords
Bayesian network; Conditional independence; Scoring function; d-separation
Categories
Funding
- National Natural Science Foundation of China (NSFC) [61672113, 61373036]
- Key Projects of Fundamental Research Program of Shanghai Municipal Commission of Science and Technology [14JC1400300]
- Program of Shanghai Subject Chief Scientist [15XD1503600]
Ask authors/readers for more resources
Most existing algorithms for learning Bayesian networks (BNs) can be categorized as constraint-based or score-based methods. Constraint-based algorithms use conditional independence (CI) tests to judge the presence or absence of an edge. Though effective and applicable to (high-dimensional data) large-scale networks, CI tests require a large number of samples to determine the independencies. Thus they can be unreliable especially when the sample size is small. On the other hand, score-based methods employ a score metric to evaluate each candidate network structure, but they are inefficient in learning large-scale networks due to the extremely large search space. In this paper, we propose a new hybrid Bayesian network learning method, SAR (the abbreviation of Separation And Reunion), which maintains the merits of both types of learning techniques while avoiding their drawbacks. Extensive experiments show that our method generally achieves better performance than state-of-the-art methods. (C) 2017 Published by Elsevier B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available