Learning the structure of Bayesian networks with ancestral and/or heuristic partition
Journal article
Tan, X., Gao, X., Wang, Z., Han, H., Liu, X. and Chen, D. (2021). Learning the structure of Bayesian networks with ancestral and/or heuristic partition. Information Sciences. https://doi.org/10.1016/j.ins.2021.10.052
Authors | Tan, X., Gao, X., Wang, Z., Han, H., Liu, X. and Chen, D. |
---|---|
Abstract | Developing efficient strategies for searching larger Bayesian networks in exact structure learning is an open challenge. In this study, ancestral and heuristic partition constraints are proposed to develop a series of exact learning algorithms, in which an ancestral partition is used to prune the order graph of a Bayesian network, and a heuristic partition is utilized to improve the tightness of the heuristic function. Algorithms for calculating these two types of constraints are established through thorough theoretical proof. Comparative experiments have been undertaken with state-of-the-art algorithms. It has been demonstrated that an algorithm improved with the proposed ancestral partition or combined ancestral and heuristic partition outperforms the algorithm in its original form, and it can have lower running time, fewer expanded states, and higher accuracy, as well as the ability to search larger networks within 100 nodes. |
Keywords | Bayesian network; Structure Learning; order graph; heuristic function |
Year | 2021 |
Journal | Information Sciences |
Publisher | Elsevier |
Digital Object Identifier (DOI) | https://doi.org/10.1016/j.ins.2021.10.052 |
Web address (URL) | https://www.journals.elsevier.com/information-sciences |
Publication dates | |
04 Nov 2021 | |
Publication process dates | |
Accepted | 19 Oct 2021 |
Deposited | 22 Nov 2021 |
Accepted author manuscript | License File Access Level Open |
https://openresearch.lsbu.ac.uk/item/8y7y7
Download files
141
total views20
total downloads5
views this month1
downloads this month