Affiliation:
1. School of Electronics and Information Engineering, Xi’an Technological University, Xi’an 710021, China
2. School of Electronic Information, Northwestern Polytechnical University, Xi’an 710192, China
Abstract
Learning the structure of a Bayesian network and considering the efficiency and accuracy of learning has always been a hot topic for researchers. This paper proposes two constraints to solve the problem that the A* algorithm, an exact learning algorithm, is not efficient enough to search larger networks. On the one hand, the parent–child set constraints reduce the number of potential optimal parent sets. On the other hand, the path constraints are obtained from the potential optimal parent sets to constrain the search process of the A* algorithm. Both constraints are proposed based on the potential optimal parent sets. Experiments show that the time efficiency of the A* algorithm can be significantly improved, and the ability of the A* algorithm to search larger Bayesian networks can be improved by the two constraints. In addition, compared with the globally optimal Bayesian network learning using integer linear programming (GOBNILP) algorithm and the max–min hill-climbing (MMHC) algorithm, which are state of the art, the A* algorithm enhanced by constraints still performs well in most cases.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Shaanxi Province of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference36 articles.
1. Learning Bayesian Networks is NP-Complete;Chickering;Learning from Data: Artificial Intelligence and Statistics V,1996
2. Large-sample learning of Bayesian networks is NP-hard;Chickering;J. Mach. Learn. Res.,2004
3. A survey of Bayesian Network structure learning;Kitson;Artif. Intell. Rev.,2023
4. An algorithm for fast recovery of sparse causal graphs;Spirtes;Soc. Sci. Comput. Rev.,1991
5. A theory of inferred causation;Pearl;Studies in Logic and the Foundations of Mathematics,1995