Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning

Abstract EN

Bayesian network is an important theoretical model in artificial intelligence field and also a powerful tool for processing uncertainty issues.

Considering the slow convergence speed of current Bayesian network structure learning algorithms, a fast hybrid learning method is proposed in this paper.

We start with further analysis of information provided by low-order conditional independence testing, and then two methods are given for constructing graph model of network, which is theoretically proved to be upper and lower bounds of the structure space of target network, so that candidate sets are given as a result; after that a search and scoring algorithm is operated based on the candidate sets to find the final structure of the network.

Simulation results show that the algorithm proposed in this paper is more efficient than similar algorithms with the same learning precision.