.png){kind=icon}
Return
PSL: An Algorithm for Partial Bayesian Network Structure Learning
.png){kind=icon}
PRE
AI
DOI：10.1145/3508071.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Bayesian network
local structure learning
global structure learning
markov blanket
feature selection
Journal
IF:
4.8
Papers:
1.3K
Citations:
4.4K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveWho learns better Bayesian network structures: Accuracy and speed of structure learning algorithms
OAAI
OAAIShareSaveShareSave View more