PSL: An algorithm for partial Bayesian network structure learning
Files
Date
2022
Authors
Ling, Z.
Yu, K.
Liu, L.
Li, J.
Zhang, Y.
Wu, X.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
ACM Transactions on Knowledge Discovery from Data, 2022; 16(5, article no. 93):1-25
Statement of Responsibility
Conference Name
DOI
Abstract
Learning partial Bayesian network (BN) structure is an interesting and challenging problem. In this challenge, it is computationally expensive to use global BN structure learning algorithms, while only one part of a BN structure is interesting, local BN structure learning algorithms are not a favourable solution either due to the issue of false edge orientation. To address the problem, this article first presents a detailed analysis of the false edge orientation issue with local BN structure learning algorithms and then proposes PSL, an efficient and accurate Partial BN Structure Learning (PSL) algorithm. Specifically, PSL divides V-structures in a Markov blanket (MB) into two types: Type-C V-structures and Type-NC V-structures, then it starts from the given node of interest and recursively finds both types of V-structures in the MB of the current node until all edges in the partial BN structure are oriented. To further improve the efficiency of PSL, the PSL-FS algorithm is designed by incorporating Feature Selection (FS) into PSL. Extensive experiments with six benchmark BNs validate the efficiency and accuracy of the proposed algorithms.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2022 Association for Computing Machinery
Access Condition Notes: Accepted manuscript available after 1 April 2023